./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s5lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s5lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 19:49:45,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:49:45,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:49:45,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:49:45,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:49:45,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:49:45,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:49:45,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:49:45,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:49:45,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:49:45,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:49:45,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:49:45,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:49:45,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:49:45,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:49:45,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:49:45,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:49:45,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:49:45,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:49:45,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:49:45,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:49:45,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:49:45,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:49:45,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:49:45,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:49:45,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:49:45,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:49:45,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:49:45,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:49:45,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:49:45,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:49:45,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:49:45,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:49:45,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:49:45,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:49:45,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:49:45,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:49:45,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:49:45,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:49:45,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:49:45,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:49:45,310 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 19:49:45,324 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:49:45,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:49:45,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:49:45,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:49:45,325 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:49:45,325 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:49:45,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:49:45,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:49:45,326 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:49:45,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:49:45,326 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:49:45,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:49:45,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:49:45,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:49:45,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:49:45,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:49:45,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:49:45,327 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:49:45,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:49:45,327 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:49:45,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:49:45,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:49:45,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:49:45,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:49:45,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:49:45,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:49:45,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:49:45,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:49:45,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:49:45,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:49:45,328 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:49:45,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:49:45,328 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:49:45,329 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:49:45,329 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:49:45,329 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b [2022-12-13 19:49:45,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:49:45,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:49:45,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:49:45,546 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:49:45,547 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:49:45,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-fpi/s5lif.c [2022-12-13 19:49:48,079 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:49:48,217 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:49:48,218 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/sv-benchmarks/c/array-fpi/s5lif.c [2022-12-13 19:49:48,222 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/data/ebefe3610/092db8b959c847b1a3067fda0234810c/FLAG359812fb3 [2022-12-13 19:49:48,639 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/data/ebefe3610/092db8b959c847b1a3067fda0234810c [2022-12-13 19:49:48,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:49:48,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:49:48,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:49:48,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:49:48,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:49:48,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d226dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48, skipping insertion in model container [2022-12-13 19:49:48,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:49:48,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:49:48,791 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-12-13 19:49:48,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:49:48,818 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:49:48,831 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-12-13 19:49:48,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:49:48,852 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:49:48,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48 WrapperNode [2022-12-13 19:49:48,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:49:48,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:49:48,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:49:48,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:49:48,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,886 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-12-13 19:49:48,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:49:48,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:49:48,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:49:48,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:49:48,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,909 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:49:48,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:49:48,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:49:48,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:49:48,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (1/1) ... [2022-12-13 19:49:48,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:49:48,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:49:48,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:49:48,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:49:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:49:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:49:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:49:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:49:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 19:49:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:49:49,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:49:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 19:49:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:49:49,056 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:49:49,058 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:49:49,166 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:49:49,170 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:49:49,170 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 19:49:49,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:49:49 BoogieIcfgContainer [2022-12-13 19:49:49,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:49:49,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:49:49,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:49:49,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:49:49,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:49:48" (1/3) ... [2022-12-13 19:49:49,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405f1a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:49:49, skipping insertion in model container [2022-12-13 19:49:49,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:48" (2/3) ... [2022-12-13 19:49:49,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405f1a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:49:49, skipping insertion in model container [2022-12-13 19:49:49,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:49:49" (3/3) ... [2022-12-13 19:49:49,177 INFO L112 eAbstractionObserver]: Analyzing ICFG s5lif.c [2022-12-13 19:49:49,191 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:49:49,191 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 19:49:49,224 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:49:49,228 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@773ed5e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:49:49,229 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 19:49:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:49,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 19:49:49,236 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:49:49,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:49:49,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:49:49,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:49:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-12-13 19:49:49,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:49:49,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091839111] [2022-12-13 19:49:49,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:49:49,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:49:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:49:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:49:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:49:49,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091839111] [2022-12-13 19:49:49,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091839111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:49:49,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:49:49,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:49:49,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771604737] [2022-12-13 19:49:49,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:49:49,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 19:49:49,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:49:49,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 19:49:49,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 19:49:49,391 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:49:49,402 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-12-13 19:49:49,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 19:49:49,404 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 19:49:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:49:49,409 INFO L225 Difference]: With dead ends: 40 [2022-12-13 19:49:49,409 INFO L226 Difference]: Without dead ends: 18 [2022-12-13 19:49:49,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 19:49:49,414 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:49:49,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:49:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-13 19:49:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-13 19:49:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-12-13 19:49:49,437 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-12-13 19:49:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:49:49,437 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-12-13 19:49:49,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-12-13 19:49:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 19:49:49,438 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:49:49,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:49:49,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:49:49,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:49:49,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:49:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-12-13 19:49:49,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:49:49,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490577004] [2022-12-13 19:49:49,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:49:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:49:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:49:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:49:49,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:49:49,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490577004] [2022-12-13 19:49:49,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490577004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:49:49,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:49:49,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:49:49,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170854149] [2022-12-13 19:49:49,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:49:49,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:49:49,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:49:49,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:49:49,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:49:49,549 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:49:49,600 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-12-13 19:49:49,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:49:49,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 19:49:49,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:49:49,601 INFO L225 Difference]: With dead ends: 36 [2022-12-13 19:49:49,601 INFO L226 Difference]: Without dead ends: 25 [2022-12-13 19:49:49,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:49:49,603 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:49:49,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:49:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-13 19:49:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-12-13 19:49:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-12-13 19:49:49,609 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-12-13 19:49:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:49:49,609 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-12-13 19:49:49,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-12-13 19:49:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 19:49:49,610 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:49:49,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:49:49,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:49:49,610 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:49:49,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:49:49,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-12-13 19:49:49,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:49:49,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655123501] [2022-12-13 19:49:49,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:49:49,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:49:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:49:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:49:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:49:50,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655123501] [2022-12-13 19:49:50,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655123501] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:49:50,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910893853] [2022-12-13 19:49:50,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:49:50,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:49:50,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:49:50,448 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:49:50,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:49:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:49:50,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 19:49:50,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:49:50,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 19:49:50,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 19:49:50,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:49:50,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 19:49:50,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-12-13 19:49:50,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-12-13 19:49:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:49:50,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:49:51,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:49:51,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 44 [2022-12-13 19:49:51,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:49:51,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2022-12-13 19:49:51,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:49:51,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2022-12-13 19:49:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:49:51,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910893853] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:49:51,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:49:51,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 28 [2022-12-13 19:49:51,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546278103] [2022-12-13 19:49:51,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:49:51,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 19:49:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:49:51,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 19:49:51,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-12-13 19:49:51,436 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:49:52,149 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-12-13 19:49:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 19:49:52,149 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 19:49:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:49:52,151 INFO L225 Difference]: With dead ends: 53 [2022-12-13 19:49:52,151 INFO L226 Difference]: Without dead ends: 49 [2022-12-13 19:49:52,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=342, Invalid=1218, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 19:49:52,153 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:49:52,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 81 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 19:49:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-13 19:49:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2022-12-13 19:49:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-12-13 19:49:52,159 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-12-13 19:49:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:49:52,159 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-12-13 19:49:52,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-12-13 19:49:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 19:49:52,160 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:49:52,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:49:52,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:49:52,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-13 19:49:52,362 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:49:52,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:49:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-12-13 19:49:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:49:52,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193916283] [2022-12-13 19:49:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:49:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:49:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:49:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:49:52,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:49:52,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193916283] [2022-12-13 19:49:52,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193916283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:49:52,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686789206] [2022-12-13 19:49:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:49:52,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:49:52,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:49:52,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:49:52,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:49:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:49:52,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 19:49:52,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:49:52,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-12-13 19:49:52,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 19:49:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:49:52,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:49:52,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-13 19:49:52,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 19:49:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:49:52,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686789206] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:49:52,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:49:52,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 19:49:52,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261441089] [2022-12-13 19:49:52,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:49:52,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 19:49:52,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:49:52,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 19:49:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 19:49:52,781 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:49:52,855 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-12-13 19:49:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:49:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 19:49:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:49:52,856 INFO L225 Difference]: With dead ends: 48 [2022-12-13 19:49:52,857 INFO L226 Difference]: Without dead ends: 37 [2022-12-13 19:49:52,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-13 19:49:52,858 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:49:52,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 62 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:49:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-13 19:49:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-12-13 19:49:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-12-13 19:49:52,863 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-12-13 19:49:52,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:49:52,863 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-12-13 19:49:52,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-12-13 19:49:52,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 19:49:52,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:49:52,864 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:49:52,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 19:49:53,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:49:53,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:49:53,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:49:53,065 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-12-13 19:49:53,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:49:53,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436636647] [2022-12-13 19:49:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:49:53,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:49:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:49:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:49:53,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:49:53,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436636647] [2022-12-13 19:49:53,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436636647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:49:53,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351283902] [2022-12-13 19:49:53,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:49:53,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:49:53,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:49:53,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:49:53,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 19:49:53,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:49:53,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:49:53,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 19:49:53,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:49:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:49:53,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:49:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:49:53,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351283902] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:49:53,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:49:53,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 19:49:53,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761856311] [2022-12-13 19:49:53,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:49:53,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:49:53,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:49:53,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:49:53,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:49:53,266 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:49:53,354 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-12-13 19:49:53,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 19:49:53,355 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 19:49:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:49:53,355 INFO L225 Difference]: With dead ends: 70 [2022-12-13 19:49:53,355 INFO L226 Difference]: Without dead ends: 44 [2022-12-13 19:49:53,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-12-13 19:49:53,357 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 50 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:49:53,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 30 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:49:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-13 19:49:53,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-12-13 19:49:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-12-13 19:49:53,364 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-12-13 19:49:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:49:53,365 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-12-13 19:49:53,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-12-13 19:49:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 19:49:53,365 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:49:53,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:49:53,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 19:49:53,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:49:53,566 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:49:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:49:53,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-12-13 19:49:53,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:49:53,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006549202] [2022-12-13 19:49:53,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:49:53,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:49:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:49:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:49:53,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:49:53,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006549202] [2022-12-13 19:49:53,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006549202] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:49:53,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82666596] [2022-12-13 19:49:53,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:49:53,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:49:53,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:49:53,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:49:53,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 19:49:53,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 19:49:53,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:49:53,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 19:49:53,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:49:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:49:53,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:49:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:49:53,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82666596] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:49:53,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:49:53,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 19:49:53,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566185225] [2022-12-13 19:49:53,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:49:53,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:49:53,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:49:53,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:49:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:49:53,762 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:49:53,847 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-12-13 19:49:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 19:49:53,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 19:49:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:49:53,848 INFO L225 Difference]: With dead ends: 39 [2022-12-13 19:49:53,848 INFO L226 Difference]: Without dead ends: 31 [2022-12-13 19:49:53,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:49:53,849 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:49:53,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 24 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:49:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-13 19:49:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-12-13 19:49:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-12-13 19:49:53,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-12-13 19:49:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:49:53,856 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-12-13 19:49:53,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:49:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-12-13 19:49:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 19:49:53,857 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:49:53,857 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:49:53,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 19:49:54,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 19:49:54,058 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:49:54,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:49:54,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-12-13 19:49:54,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:49:54,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717074272] [2022-12-13 19:49:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:49:54,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:49:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:49:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:49:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:49:55,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717074272] [2022-12-13 19:49:55,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717074272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:49:55,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471049928] [2022-12-13 19:49:55,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:49:55,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:49:55,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:49:55,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:49:55,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 19:49:55,158 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:49:55,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:49:55,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 19:49:55,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:49:55,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 19:49:55,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 19:49:55,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:49:55,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:49:55,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 19:49:55,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:49:55,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-12-13 19:49:55,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:49:55,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:49:55,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-12-13 19:49:55,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-12-13 19:49:55,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2022-12-13 19:49:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:49:55,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:49:57,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:49:57,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2022-12-13 19:50:06,996 WARN L233 SmtUtils]: Spent 9.80s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:50:15,015 WARN L233 SmtUtils]: Spent 7.83s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:50:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:15,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471049928] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:50:15,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:50:15,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 49 [2022-12-13 19:50:15,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510362154] [2022-12-13 19:50:15,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:50:15,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 19:50:15,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:15,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 19:50:15,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1995, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 19:50:15,078 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:50:47,078 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-12-13 19:50:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-13 19:50:47,078 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 19:50:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:50:47,079 INFO L225 Difference]: With dead ends: 99 [2022-12-13 19:50:47,079 INFO L226 Difference]: Without dead ends: 85 [2022-12-13 19:50:47,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2445 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=1277, Invalid=6913, Unknown=0, NotChecked=0, Total=8190 [2022-12-13 19:50:47,081 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 89 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:50:47,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 116 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-13 19:50:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-12-13 19:50:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 55. [2022-12-13 19:50:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-12-13 19:50:47,090 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 27 [2022-12-13 19:50:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:50:47,090 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-12-13 19:50:47,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-12-13 19:50:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 19:50:47,090 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:50:47,091 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:47,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 19:50:47,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 19:50:47,292 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:50:47,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:47,293 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-12-13 19:50:47,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:47,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654720809] [2022-12-13 19:50:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:50:47,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:47,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654720809] [2022-12-13 19:50:47,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654720809] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:50:47,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40675437] [2022-12-13 19:50:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:47,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:50:47,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:50:47,721 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:50:47,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 19:50:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:47,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 19:50:47,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:50:47,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 19:50:47,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:50:47,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 19:50:47,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 19:50:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:50:47,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:50:48,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-12-13 19:50:48,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-12-13 19:50:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:50:48,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40675437] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:50:48,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:50:48,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-12-13 19:50:48,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46193052] [2022-12-13 19:50:48,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:50:48,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:50:48,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:48,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:50:48,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:50:48,096 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:50:48,391 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2022-12-13 19:50:48,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 19:50:48,392 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 19:50:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:50:48,392 INFO L225 Difference]: With dead ends: 79 [2022-12-13 19:50:48,392 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 19:50:48,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-13 19:50:48,394 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:50:48,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:50:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 19:50:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-12-13 19:50:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2022-12-13 19:50:48,403 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 27 [2022-12-13 19:50:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:50:48,403 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2022-12-13 19:50:48,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2022-12-13 19:50:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 19:50:48,405 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:50:48,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:48,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 19:50:48,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:50:48,605 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:50:48,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-12-13 19:50:48,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:48,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719120902] [2022-12-13 19:50:48,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:50:48,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:48,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719120902] [2022-12-13 19:50:48,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719120902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:50:48,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765567389] [2022-12-13 19:50:48,774 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:50:48,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:50:48,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:50:48,775 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:50:48,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 19:50:48,845 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 19:50:48,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:50:48,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 19:50:48,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:50:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:50:49,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:50:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:50:49,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765567389] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:50:49,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:50:49,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 19:50:49,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327077830] [2022-12-13 19:50:49,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:50:49,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:50:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:49,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:50:49,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:50:49,146 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:50:49,442 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-12-13 19:50:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:50:49,442 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 19:50:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:50:49,443 INFO L225 Difference]: With dead ends: 91 [2022-12-13 19:50:49,443 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 19:50:49,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-12-13 19:50:49,444 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:50:49,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 28 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:50:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 19:50:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-12-13 19:50:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-12-13 19:50:49,452 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-12-13 19:50:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:50:49,452 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-12-13 19:50:49,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-12-13 19:50:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 19:50:49,453 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:50:49,453 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:49,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 19:50:49,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:50:49,654 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:50:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2022-12-13 19:50:49,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:49,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791897343] [2022-12-13 19:50:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:49,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:50:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:49,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791897343] [2022-12-13 19:50:49,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791897343] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:50:49,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165891339] [2022-12-13 19:50:49,827 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 19:50:49,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:50:49,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:50:49,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:50:49,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 19:50:49,897 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 19:50:49,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:50:49,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 19:50:49,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:50:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:50:50,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:50:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:50:50,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165891339] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:50:50,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:50:50,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 19:50:50,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451910056] [2022-12-13 19:50:50,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:50:50,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:50:50,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:50:50,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:50:50,225 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:50:50,572 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-12-13 19:50:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 19:50:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 19:50:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:50:50,573 INFO L225 Difference]: With dead ends: 48 [2022-12-13 19:50:50,573 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 19:50:50,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-12-13 19:50:50,574 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:50:50,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 30 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:50:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 19:50:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-12-13 19:50:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-12-13 19:50:50,582 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2022-12-13 19:50:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:50:50,583 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-12-13 19:50:50,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-12-13 19:50:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 19:50:50,583 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:50:50,583 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:50,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 19:50:50,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:50:50,784 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:50:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:50,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-12-13 19:50:50,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:50,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653158122] [2022-12-13 19:50:50,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:50,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:53,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:53,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653158122] [2022-12-13 19:50:53,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653158122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:50:53,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980237244] [2022-12-13 19:50:53,596 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 19:50:53,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:50:53,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:50:53,597 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:50:53,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 19:50:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:53,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-13 19:50:53,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:50:53,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 19:50:53,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 19:50:53,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:50:53,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:50:53,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:50:54,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 19:50:54,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:50:54,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-12-13 19:50:54,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:50:54,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:50:54,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-12-13 19:50:55,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:50:55,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:50:55,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:50:55,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-13 19:50:55,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:50:55,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:50:55,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:50:55,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:50:55,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-12-13 19:50:55,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2022-12-13 19:50:55,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2022-12-13 19:50:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:55,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:51:01,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:51:01,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2022-12-13 19:51:04,081 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse1) 6)) (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse4 .cse5))))) (+ .cse6 1)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (< .cse6 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse9 .cse10 1)))))) (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse1) 6)))))) is different from false [2022-12-13 19:51:04,245 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse3 .cse4))))) (+ 7 .cse6)) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse5) 6)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (< (+ .cse6 5) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse9 .cse10)))))) (not (= (select v_arrayElimArr_4 .cse5) 6)))))) is different from false [2022-12-13 19:51:07,102 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (< (+ .cse1 11) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse4 .cse5)))))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse6) 6)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse6) 6)) (< (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse9 .cse10))))) (+ .cse1 13)))))) is different from false [2022-12-13 19:51:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-13 19:51:07,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980237244] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:51:07,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:51:07,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 62 [2022-12-13 19:51:07,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644404839] [2022-12-13 19:51:07,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:51:07,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-12-13 19:51:07,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:51:07,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-12-13 19:51:07,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=3009, Unknown=3, NotChecked=348, Total=3782 [2022-12-13 19:51:07,282 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:51:57,368 WARN L233 SmtUtils]: Spent 19.47s on a formula simplification. DAG size of input: 71 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:52:42,776 WARN L233 SmtUtils]: Spent 17.29s on a formula simplification. DAG size of input: 72 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:53:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:53:05,181 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-12-13 19:53:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 19:53:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-13 19:53:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:53:05,183 INFO L225 Difference]: With dead ends: 90 [2022-12-13 19:53:05,183 INFO L226 Difference]: Without dead ends: 76 [2022-12-13 19:53:05,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 124.1s TimeCoverageRelationStatistics Valid=722, Invalid=4817, Unknown=23, NotChecked=444, Total=6006 [2022-12-13 19:53:05,185 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:53:05,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 182 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1048 Invalid, 0 Unknown, 172 Unchecked, 7.0s Time] [2022-12-13 19:53:05,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-13 19:53:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2022-12-13 19:53:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:53:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-12-13 19:53:05,197 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 34 [2022-12-13 19:53:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:53:05,197 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-12-13 19:53:05,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:53:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-12-13 19:53:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 19:53:05,198 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:53:05,198 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:53:05,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 19:53:05,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:53:05,399 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:53:05,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:53:05,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-12-13 19:53:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:53:05,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081370706] [2022-12-13 19:53:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:53:05,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:53:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:53:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 19:53:06,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:53:06,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081370706] [2022-12-13 19:53:06,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081370706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:53:06,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141900588] [2022-12-13 19:53:06,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:53:06,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:53:06,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:53:06,600 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:53:06,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 19:53:06,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:53:06,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:53:06,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 19:53:06,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:53:07,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:53:07,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:07,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 19:53:07,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:07,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 19:53:07,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 19:53:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 19:53:08,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:53:08,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-12-13 19:53:08,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-12-13 19:53:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 19:53:09,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141900588] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:53:09,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:53:09,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-12-13 19:53:09,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411575851] [2022-12-13 19:53:09,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:53:09,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 19:53:09,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:53:09,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 19:53:09,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-12-13 19:53:09,097 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:53:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:53:12,799 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-12-13 19:53:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 19:53:12,800 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-13 19:53:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:53:12,800 INFO L225 Difference]: With dead ends: 77 [2022-12-13 19:53:12,801 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 19:53:12,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 19:53:12,802 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 19:53:12,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 79 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-13 19:53:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 19:53:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-12-13 19:53:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:53:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-12-13 19:53:12,817 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-12-13 19:53:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:53:12,818 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-12-13 19:53:12,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:53:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-12-13 19:53:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 19:53:12,818 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:53:12,818 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:53:12,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 19:53:13,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 19:53:13,020 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:53:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:53:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-12-13 19:53:13,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:53:13,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991737328] [2022-12-13 19:53:13,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:53:13,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:53:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:53:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:53:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:53:13,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991737328] [2022-12-13 19:53:13,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991737328] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:53:13,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828855747] [2022-12-13 19:53:13,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:53:13,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:53:13,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:53:13,513 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:53:13,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 19:53:13,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:53:13,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:53:13,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:53:13,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:53:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:53:14,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:53:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:53:15,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828855747] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:53:15,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:53:15,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 19:53:15,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222660412] [2022-12-13 19:53:15,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:53:15,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 19:53:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:53:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 19:53:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-12-13 19:53:15,019 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:53:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:53:16,112 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2022-12-13 19:53:16,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 19:53:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 19:53:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:53:16,113 INFO L225 Difference]: With dead ends: 99 [2022-12-13 19:53:16,113 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 19:53:16,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-12-13 19:53:16,114 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 114 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 19:53:16,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 30 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 19:53:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 19:53:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-12-13 19:53:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:53:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-12-13 19:53:16,126 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-12-13 19:53:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:53:16,126 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-12-13 19:53:16,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:53:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-12-13 19:53:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 19:53:16,127 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:53:16,127 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:53:16,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 19:53:16,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:53:16,329 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:53:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:53:16,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2022-12-13 19:53:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:53:16,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165075712] [2022-12-13 19:53:16,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:53:16,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:53:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:53:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 19:53:16,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:53:16,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165075712] [2022-12-13 19:53:16,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165075712] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:53:16,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551589849] [2022-12-13 19:53:16,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:53:16,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:53:16,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:53:16,870 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:53:16,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 19:53:16,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 19:53:16,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:53:17,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:53:17,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:53:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 19:53:17,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:53:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 19:53:18,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551589849] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:53:18,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:53:18,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 19:53:18,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896818051] [2022-12-13 19:53:18,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:53:18,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 19:53:18,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:53:18,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 19:53:18,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-12-13 19:53:18,373 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:53:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:53:20,084 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-12-13 19:53:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 19:53:20,085 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 19:53:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:53:20,086 INFO L225 Difference]: With dead ends: 57 [2022-12-13 19:53:20,086 INFO L226 Difference]: Without dead ends: 45 [2022-12-13 19:53:20,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-12-13 19:53:20,087 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 66 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:53:20,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 33 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 19:53:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-13 19:53:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-12-13 19:53:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:53:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-12-13 19:53:20,098 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2022-12-13 19:53:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:53:20,099 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-12-13 19:53:20,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:53:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-12-13 19:53:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 19:53:20,099 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:53:20,099 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:53:20,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 19:53:20,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 19:53:20,301 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:53:20,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:53:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-12-13 19:53:20,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:53:20,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011691831] [2022-12-13 19:53:20,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:53:20,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:53:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:53:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:53:30,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:53:30,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011691831] [2022-12-13 19:53:30,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011691831] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:53:30,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185845786] [2022-12-13 19:53:30,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:53:30,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:53:30,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:53:30,439 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:53:30,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 19:53:30,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:53:30,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:53:30,538 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 99 conjunts are in the unsatisfiable core [2022-12-13 19:53:30,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:53:30,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 19:53:30,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 19:53:30,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:53:30,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:53:30,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:53:31,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:53:32,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 19:53:33,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-12-13 19:53:35,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:35,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:35,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:35,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2022-12-13 19:53:37,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:37,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:37,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:37,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-12-13 19:53:38,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:53:38,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:38,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:38,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:38,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-12-13 19:53:39,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:39,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:39,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:39,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:39,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:53:39,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:39,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:39,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2022-12-13 19:53:41,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:41,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:41,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:41,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:41,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:41,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:53:41,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:53:41,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2022-12-13 19:53:42,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-12-13 19:53:43,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 41 [2022-12-13 19:53:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:53:43,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:54:09,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:54:09,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 2288 treesize of output 520 [2022-12-13 19:54:12,937 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse8 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse6 .cse7)))))) (+ 7 .cse9)) (not (= 6 (select v_arrayElimArr_5 .cse8))) (not (= 6 .cse6))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (< (+ .cse9 5) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse14 .cse15))))))) (not (= 6 (select v_arrayElimArr_5 .cse8))) (not (= 6 .cse14))))))) is different from false [2022-12-13 19:54:15,954 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (+ .cse9 13)) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= (select v_arrayElimArr_5 .cse7) 6)) (not (= 6 (select v_arrayElimArr_5 .cse6))) (not (= 6 .cse4))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= (select v_arrayElimArr_5 .cse7) 6)) (not (= 6 (select v_arrayElimArr_5 .cse6))) (< (+ .cse9 11) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse14 .cse15))))))) (not (= 6 .cse14))))))) is different from false [2022-12-13 19:54:19,266 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (not (= 6 (select v_arrayElimArr_5 .cse2))) (not (= 6 .cse3)) (< (+ .cse4 17) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse5 .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse9)))))))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (not (= 6 (select v_arrayElimArr_5 .cse2))) (< (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse14 .cse15)))))) (+ 19 .cse4)) (not (= 6 .cse14))))))) is different from false [2022-12-13 19:54:22,221 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ 23 .cse0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6))))))) (not (= (select v_arrayElimArr_5 .cse9) 6)) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= 6 (select v_arrayElimArr_5 .cse7))) (not (= 6 .cse5))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse9) 6)) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= 6 (select v_arrayElimArr_5 .cse7))) (< (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14 .cse15)))))) (+ .cse0 25)) (not (= 6 .cse14))))))) is different from false [2022-12-13 19:54:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-12-13 19:54:22,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185845786] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:54:22,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:54:22,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 79 [2022-12-13 19:54:22,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182885402] [2022-12-13 19:54:22,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:54:22,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-12-13 19:54:22,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:54:22,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-12-13 19:54:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=5026, Unknown=4, NotChecked=596, Total=6162 [2022-12-13 19:54:22,504 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 79 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:31,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-12-13 19:54:31,309 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-13 19:54:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:54:31,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=536, Invalid=5026, Unknown=4, NotChecked=596, Total=6162 [2022-12-13 19:54:31,313 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:54:31,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 14 Unchecked, 1.2s Time] [2022-12-13 19:54:31,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 19:54:31,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 19:54:31,516 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:898) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:772) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 48 more [2022-12-13 19:54:31,524 INFO L158 Benchmark]: Toolchain (without parser) took 282881.13ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 102.3MB in the beginning and 118.3MB in the end (delta: -16.0MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-12-13 19:54:31,525 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:54:31,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.42ms. Allocated memory is still 155.2MB. Free memory was 102.3MB in the beginning and 91.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:54:31,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.61ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 89.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:54:31,527 INFO L158 Benchmark]: Boogie Preprocessor took 25.23ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 88.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:54:31,527 INFO L158 Benchmark]: RCFGBuilder took 259.03ms. Allocated memory is still 155.2MB. Free memory was 88.5MB in the beginning and 116.8MB in the end (delta: -28.3MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-12-13 19:54:31,528 INFO L158 Benchmark]: TraceAbstraction took 282350.05ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 116.4MB in the beginning and 118.3MB in the end (delta: -1.9MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2022-12-13 19:54:31,530 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.42ms. Allocated memory is still 155.2MB. Free memory was 102.3MB in the beginning and 91.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.61ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 89.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.23ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 88.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 259.03ms. Allocated memory is still 155.2MB. Free memory was 88.5MB in the beginning and 116.8MB in the end (delta: -28.3MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * TraceAbstraction took 282350.05ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 116.4MB in the beginning and 118.3MB in the end (delta: -1.9MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s5lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 19:54:32,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:54:32,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:54:32,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:54:32,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:54:32,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:54:32,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:54:32,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:54:32,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:54:32,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:54:32,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:54:32,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:54:32,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:54:32,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:54:32,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:54:32,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:54:32,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:54:32,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:54:32,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:54:32,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:54:32,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:54:32,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:54:32,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:54:32,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:54:32,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:54:32,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:54:32,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:54:32,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:54:32,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:54:32,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:54:32,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:54:32,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:54:32,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:54:32,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:54:32,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:54:32,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:54:32,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:54:32,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:54:32,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:54:32,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:54:32,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:54:32,914 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-12-13 19:54:32,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:54:32,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:54:32,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:54:32,936 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:54:32,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:54:32,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:54:32,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:54:32,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:54:32,938 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:54:32,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:54:32,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:54:32,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:54:32,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:54:32,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:54:32,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:54:32,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:54:32,940 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 19:54:32,940 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 19:54:32,940 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 19:54:32,940 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:54:32,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:54:32,941 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:54:32,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:54:32,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:54:32,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:54:32,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:54:32,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:54:32,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:54:32,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:54:32,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:54:32,942 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 19:54:32,942 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 19:54:32,942 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:54:32,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:54:32,943 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:54:32,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:54:32,943 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 19:54:32,943 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:54:32,943 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b [2022-12-13 19:54:33,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:54:33,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:54:33,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:54:33,164 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:54:33,164 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:54:33,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-fpi/s5lif.c [2022-12-13 19:54:35,728 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:54:35,896 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:54:35,896 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/sv-benchmarks/c/array-fpi/s5lif.c [2022-12-13 19:54:35,903 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/data/15682d1a4/99856d20ee944965aee5e237dadc080e/FLAG9dee68e74 [2022-12-13 19:54:35,917 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/data/15682d1a4/99856d20ee944965aee5e237dadc080e [2022-12-13 19:54:35,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:54:35,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:54:35,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:54:35,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:54:35,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:54:35,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:54:35" (1/1) ... [2022-12-13 19:54:35,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fcd970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:35, skipping insertion in model container [2022-12-13 19:54:35,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:54:35" (1/1) ... [2022-12-13 19:54:35,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:54:35,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:54:36,096 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-12-13 19:54:36,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:54:36,129 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:54:36,143 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-12-13 19:54:36,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:54:36,168 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:54:36,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36 WrapperNode [2022-12-13 19:54:36,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:54:36,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:54:36,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:54:36,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:54:36,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (1/1) ... [2022-12-13 19:54:36,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (1/1) ... [2022-12-13 19:54:36,205 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-12-13 19:54:36,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:54:36,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:54:36,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:54:36,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:54:36,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (1/1) ... [2022-12-13 19:54:36,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (1/1) ... [2022-12-13 19:54:36,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (1/1) ... [2022-12-13 19:54:36,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (1/1) ... [2022-12-13 19:54:36,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (1/1) ... [2022-12-13 19:54:36,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (1/1) ... [2022-12-13 19:54:36,231 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (1/1) ... [2022-12-13 19:54:36,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (1/1) ... [2022-12-13 19:54:36,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:54:36,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:54:36,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:54:36,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:54:36,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (1/1) ... [2022-12-13 19:54:36,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:54:36,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:54:36,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:54:36,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:54:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:54:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 19:54:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:54:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-12-13 19:54:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 19:54:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 19:54:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:54:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:54:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-12-13 19:54:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:54:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 19:54:36,364 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:54:36,366 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:54:36,516 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:54:36,522 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:54:36,523 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 19:54:36,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:54:36 BoogieIcfgContainer [2022-12-13 19:54:36,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:54:36,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:54:36,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:54:36,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:54:36,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:54:35" (1/3) ... [2022-12-13 19:54:36,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a27258e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:54:36, skipping insertion in model container [2022-12-13 19:54:36,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:36" (2/3) ... [2022-12-13 19:54:36,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a27258e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:54:36, skipping insertion in model container [2022-12-13 19:54:36,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:54:36" (3/3) ... [2022-12-13 19:54:36,533 INFO L112 eAbstractionObserver]: Analyzing ICFG s5lif.c [2022-12-13 19:54:36,553 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:54:36,553 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 19:54:36,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:54:36,607 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c348291, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:54:36,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 19:54:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:36,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 19:54:36,618 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:54:36,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:36,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:54:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-12-13 19:54:36,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:54:36,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335409577] [2022-12-13 19:54:36,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:36,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:54:36,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:54:36,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:54:36,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 19:54:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:36,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 19:54:36,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:54:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:36,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:54:36,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:54:36,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335409577] [2022-12-13 19:54:36,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335409577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:54:36,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:54:36,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:54:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88042306] [2022-12-13 19:54:36,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:54:36,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 19:54:36,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:54:36,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 19:54:36,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 19:54:36,788 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:36,799 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-12-13 19:54:36,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 19:54:36,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 19:54:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:54:36,805 INFO L225 Difference]: With dead ends: 40 [2022-12-13 19:54:36,806 INFO L226 Difference]: Without dead ends: 18 [2022-12-13 19:54:36,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 19:54:36,810 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:54:36,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:54:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-13 19:54:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-13 19:54:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-12-13 19:54:36,835 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-12-13 19:54:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:54:36,836 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-12-13 19:54:36,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-12-13 19:54:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 19:54:36,836 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:54:36,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:36,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:54:37,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:54:37,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:54:37,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:37,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-12-13 19:54:37,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:54:37,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013523335] [2022-12-13 19:54:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:37,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:54:37,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:54:37,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:54:37,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 19:54:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:37,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 19:54:37,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:54:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:37,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:54:37,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:54:37,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013523335] [2022-12-13 19:54:37,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013523335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:54:37,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:54:37,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:54:37,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781890376] [2022-12-13 19:54:37,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:54:37,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:54:37,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:54:37,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:54:37,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:54:37,223 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:37,362 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-12-13 19:54:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:54:37,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 19:54:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:54:37,363 INFO L225 Difference]: With dead ends: 36 [2022-12-13 19:54:37,363 INFO L226 Difference]: Without dead ends: 25 [2022-12-13 19:54:37,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:54:37,365 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:54:37,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 9 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:54:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-13 19:54:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-12-13 19:54:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-12-13 19:54:37,372 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-12-13 19:54:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:54:37,372 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-12-13 19:54:37,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-12-13 19:54:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 19:54:37,373 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:54:37,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:37,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 19:54:37,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:54:37,575 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:54:37,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-12-13 19:54:37,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:54:37,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220739176] [2022-12-13 19:54:37,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:37,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:54:37,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:54:37,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:54:37,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 19:54:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:37,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 19:54:37,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:54:37,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:54:37,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-12-13 19:54:37,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 19:54:37,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:54:37,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-12-13 19:54:38,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:54:38,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2022-12-13 19:54:38,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:54:38,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 47 [2022-12-13 19:54:38,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:54:38,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 52 [2022-12-13 19:54:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:38,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:54:44,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:54:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:45,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:54:45,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220739176] [2022-12-13 19:54:45,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220739176] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:54:45,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:54:45,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-12-13 19:54:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614503952] [2022-12-13 19:54:45,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:54:45,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 19:54:45,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:54:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 19:54:45,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-12-13 19:54:45,161 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:58,878 WARN L233 SmtUtils]: Spent 7.86s on a formula simplification. DAG size of input: 65 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:54:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:59,268 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-12-13 19:54:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 19:54:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 19:54:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:54:59,270 INFO L225 Difference]: With dead ends: 49 [2022-12-13 19:54:59,270 INFO L226 Difference]: Without dead ends: 39 [2022-12-13 19:54:59,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=289, Invalid=1193, Unknown=0, NotChecked=0, Total=1482 [2022-12-13 19:54:59,271 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 68 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:54:59,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 53 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-13 19:54:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-13 19:54:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-12-13 19:54:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-12-13 19:54:59,280 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2022-12-13 19:54:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:54:59,280 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-12-13 19:54:59,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-12-13 19:54:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 19:54:59,281 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:54:59,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:59,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 19:54:59,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:54:59,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:54:59,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:59,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-12-13 19:54:59,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:54:59,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297777461] [2022-12-13 19:54:59,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:59,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:54:59,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:54:59,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:54:59,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 19:54:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:59,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 19:54:59,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:54:59,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 19:54:59,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 19:54:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:54:59,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:54:59,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-13 19:54:59,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 19:54:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:54:59,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:54:59,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297777461] [2022-12-13 19:54:59,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297777461] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:54:59,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:54:59,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-12-13 19:54:59,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087771161] [2022-12-13 19:54:59,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:54:59,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 19:54:59,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:54:59,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 19:54:59,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:54:59,771 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:59,941 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-12-13 19:54:59,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:54:59,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 19:54:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:54:59,943 INFO L225 Difference]: With dead ends: 49 [2022-12-13 19:54:59,943 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 19:54:59,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 19:54:59,944 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:54:59,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:54:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 19:54:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-12-13 19:54:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-12-13 19:54:59,952 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2022-12-13 19:54:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:54:59,953 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-12-13 19:54:59,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-12-13 19:54:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 19:54:59,953 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:54:59,954 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:59,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 19:55:00,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:55:00,156 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:55:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:55:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-12-13 19:55:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:55:00,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272070549] [2022-12-13 19:55:00,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:55:00,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:55:00,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:55:00,162 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:55:00,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 19:55:00,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:55:00,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:55:00,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:55:00,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:55:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:55:00,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:55:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:55:00,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:55:00,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272070549] [2022-12-13 19:55:00,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272070549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:55:00,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:55:00,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-12-13 19:55:00,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159245801] [2022-12-13 19:55:00,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:55:00,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:55:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:55:00,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:55:00,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:55:00,556 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:55:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:55:01,043 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-12-13 19:55:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:55:01,044 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 19:55:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:55:01,045 INFO L225 Difference]: With dead ends: 63 [2022-12-13 19:55:01,045 INFO L226 Difference]: Without dead ends: 40 [2022-12-13 19:55:01,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-12-13 19:55:01,046 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 122 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:55:01,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 27 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 19:55:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-13 19:55:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2022-12-13 19:55:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:55:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-12-13 19:55:01,050 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-12-13 19:55:01,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:55:01,051 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-12-13 19:55:01,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:55:01,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-12-13 19:55:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 19:55:01,051 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:55:01,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:55:01,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 19:55:01,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:55:01,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:55:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:55:01,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-12-13 19:55:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:55:01,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660411079] [2022-12-13 19:55:01,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:55:01,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:55:01,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:55:01,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:55:01,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 19:55:01,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 19:55:01,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:55:01,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 19:55:01,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:55:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:55:01,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:55:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:55:01,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:55:01,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660411079] [2022-12-13 19:55:01,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660411079] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:55:01,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:55:01,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2022-12-13 19:55:01,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156785154] [2022-12-13 19:55:01,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:55:01,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 19:55:01,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:55:01,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 19:55:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-12-13 19:55:01,842 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:55:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:55:02,511 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-12-13 19:55:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 19:55:02,512 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 19:55:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:55:02,512 INFO L225 Difference]: With dead ends: 72 [2022-12-13 19:55:02,512 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 19:55:02,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2022-12-13 19:55:02,514 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 276 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:55:02,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 23 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 19:55:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 19:55:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2022-12-13 19:55:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:55:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-12-13 19:55:02,524 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 22 [2022-12-13 19:55:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:55:02,524 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-12-13 19:55:02,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:55:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-12-13 19:55:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 19:55:02,525 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:55:02,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:55:02,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 19:55:02,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:55:02,727 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:55:02,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:55:02,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-12-13 19:55:02,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:55:02,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397671346] [2022-12-13 19:55:02,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:55:02,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:55:02,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:55:02,733 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:55:02,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 19:55:02,857 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:55:02,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:55:02,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 19:55:02,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:55:02,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:55:02,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-12-13 19:55:02,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 19:55:02,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 19:55:03,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 19:55:03,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:55:03,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-12-13 19:55:03,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:55:03,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 49 [2022-12-13 19:55:03,907 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 19:55:03,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 70 [2022-12-13 19:55:04,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:55:04,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 73 [2022-12-13 19:55:04,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:55:04,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 83 [2022-12-13 19:55:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:55:04,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:55:46,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:55:46,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 653 treesize of output 289 [2022-12-13 19:55:55,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:55:55,187 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 19:55:55,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 562 treesize of output 1 [2022-12-13 19:55:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:55:55,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:55:55,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397671346] [2022-12-13 19:55:55,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397671346] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:55:55,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:55:55,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2022-12-13 19:55:55,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245645702] [2022-12-13 19:55:55,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:55:55,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 19:55:55,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:55:55,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 19:55:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1058, Unknown=17, NotChecked=0, Total=1260 [2022-12-13 19:55:55,192 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:56:15,164 WARN L233 SmtUtils]: Spent 12.59s on a formula simplification. DAG size of input: 77 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:56:18,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:56:20,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:56:24,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:56:26,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:56:29,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 19:56:38,651 WARN L233 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 64 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:57:37,830 WARN L233 SmtUtils]: Spent 48.24s on a formula simplification. DAG size of input: 158 DAG size of output: 148 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:57:40,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:57:42,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:57:44,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:57:46,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:57:48,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:57:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:57:54,296 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-12-13 19:57:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 19:57:54,297 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 19:57:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:57:54,298 INFO L225 Difference]: With dead ends: 64 [2022-12-13 19:57:54,298 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 19:57:54,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 141.6s TimeCoverageRelationStatistics Valid=514, Invalid=2889, Unknown=19, NotChecked=0, Total=3422 [2022-12-13 19:57:54,300 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 84 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 31 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:57:54,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 62 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 565 Invalid, 10 Unknown, 0 Unchecked, 28.0s Time] [2022-12-13 19:57:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 19:57:54,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2022-12-13 19:57:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:57:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-12-13 19:57:54,308 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 27 [2022-12-13 19:57:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:57:54,308 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-12-13 19:57:54,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:57:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-12-13 19:57:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 19:57:54,309 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:57:54,309 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:57:54,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 19:57:54,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:57:54,511 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:57:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:57:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-12-13 19:57:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:57:54,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710185773] [2022-12-13 19:57:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:57:54,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:57:54,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:57:54,517 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:57:54,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 19:57:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:57:54,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 19:57:54,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:57:54,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:57:54,976 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 19:57:54,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 19:57:55,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 19:57:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:57:55,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:57:55,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-12-13 19:57:55,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-12-13 19:57:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:57:55,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:57:55,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710185773] [2022-12-13 19:57:55,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710185773] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:57:55,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:57:55,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-12-13 19:57:55,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628386946] [2022-12-13 19:57:55,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:57:55,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 19:57:55,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:57:55,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 19:57:55,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 19:57:55,568 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:57:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:57:56,524 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-12-13 19:57:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 19:57:56,525 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 19:57:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:57:56,526 INFO L225 Difference]: With dead ends: 69 [2022-12-13 19:57:56,526 INFO L226 Difference]: Without dead ends: 40 [2022-12-13 19:57:56,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:57:56,527 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 19:57:56,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 19:57:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-13 19:57:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-12-13 19:57:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:57:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-12-13 19:57:56,534 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2022-12-13 19:57:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:57:56,535 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-12-13 19:57:56,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:57:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-12-13 19:57:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 19:57:56,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:57:56,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:57:56,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 19:57:56,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:57:56,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:57:56,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:57:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 5 times [2022-12-13 19:57:56,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:57:56,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154282022] [2022-12-13 19:57:56,740 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:57:56,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:57:56,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:57:56,743 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:57:56,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 19:57:56,841 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 19:57:56,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:57:56,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 19:57:56,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:57:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:57:58,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:58:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:58:00,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:58:00,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154282022] [2022-12-13 19:58:00,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154282022] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:58:00,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:58:00,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2022-12-13 19:58:00,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791989524] [2022-12-13 19:58:00,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:58:00,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 19:58:00,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:58:00,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 19:58:00,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2022-12-13 19:58:00,008 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:58:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:04,287 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-12-13 19:58:04,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 19:58:04,288 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 19:58:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:04,289 INFO L225 Difference]: With dead ends: 88 [2022-12-13 19:58:04,289 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 19:58:04,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 19:58:04,290 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 325 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:04,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 23 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-13 19:58:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 19:58:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2022-12-13 19:58:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:58:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-12-13 19:58:04,299 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 29 [2022-12-13 19:58:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:04,299 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-12-13 19:58:04,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:58:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-12-13 19:58:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 19:58:04,302 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:04,302 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:04,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 19:58:04,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:58:04,504 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:58:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 6 times [2022-12-13 19:58:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:58:04,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228088937] [2022-12-13 19:58:04,507 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 19:58:04,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:58:04,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:58:04,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:58:04,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cbea145-e9af-4fb6-9d36-e37588712e00/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 19:58:04,683 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 19:58:04,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:58:04,689 WARN L261 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-13 19:58:04,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:58:04,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:58:04,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-12-13 19:58:04,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 19:58:05,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 19:58:05,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 19:58:05,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 19:58:06,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:06,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-12-13 19:58:07,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:07,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 56 [2022-12-13 19:58:08,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:08,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 61 [2022-12-13 19:58:09,285 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-13 19:58:09,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 82 [2022-12-13 19:58:10,776 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-13 19:58:10,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 96 [2022-12-13 19:58:12,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:12,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 174 treesize of output 113 [2022-12-13 19:58:12,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:12,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 212 treesize of output 142 [2022-12-13 19:58:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:58:13,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:00:15,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:00:15,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 3961 treesize of output 1239 [2022-12-13 20:00:44,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:44,583 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 20:00:44,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2506 treesize of output 1 [2022-12-13 20:00:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:00:44,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:00:44,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228088937] [2022-12-13 20:00:44,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228088937] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:00:44,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:00:44,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2022-12-13 20:00:44,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783281920] [2022-12-13 20:00:44,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:00:44,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-13 20:00:44,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:00:44,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-13 20:00:44,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1823, Unknown=30, NotChecked=0, Total=2162 [2022-12-13 20:00:44,588 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:42,816 WARN L233 SmtUtils]: Spent 38.21s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:01:45,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:47,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:49,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:51,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:53,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:56,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:59,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:18,325 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse78 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse94 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse78)) (.cse71 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse91 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse78))) (let ((.cse79 (select .cse71 .cse91)) (.cse90 (select .cse71 .cse94))) (let ((.cse29 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse78)) (.cse16 (store .cse71 .cse94 (bvadd .cse90 (_ bv5 32)))) (.cse92 (bvadd .cse79 (_ bv5 32)))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse11 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse46 (store .cse16 .cse91 .cse92)) (.cse2 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32)))) (.cse93 (select .cse71 .cse29))) (let ((.cse30 (bvadd .cse93 (_ bv5 32))) (.cse32 (not (= .cse93 (_ bv1 32)))) (.cse34 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse0 (bvule c_~N~0 (_ bv536870911 32))) (.cse28 (store .cse71 .cse91 .cse92)) (.cse31 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse47 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse1 (not (= .cse90 (_ bv1 32)))) (.cse48 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse49 (= (let ((.cse80 (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse88 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse89 (bvadd (concat (select .cse88 .cse7) (select .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse87 ((_ extract 31 0) .cse89)) (.cse86 ((_ extract 63 32) .cse89))) (let ((.cse84 (store (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse87) .cse7 .cse86))) (let ((.cse85 (bvadd ((_ sign_extend 32) (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse84) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse86 .cse87)))) (let ((.cse82 ((_ extract 31 0) .cse85)) (.cse81 ((_ extract 63 32) .cse85))) (bvadd (concat .cse81 .cse82) ((_ sign_extend 32) (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse82) .cse7 .cse81)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))) .cse2)) (.cse33 (not (= .cse79 (_ bv1 32))))) (and (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (not .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (not (bvslt (_ bv3 32) c_~N~0)) (or .cse1 (= .cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (let ((.cse14 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (bvadd ((_ sign_extend 32) (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse14 .cse7) (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse13 ((_ extract 31 0) .cse15)) (.cse12 ((_ extract 63 32) .cse15))) (let ((.cse5 (store (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13) .cse7 .cse12))) (let ((.cse10 (bvadd ((_ sign_extend 32) (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse12 .cse13)))) (let ((.cse8 ((_ extract 63 32) .cse10)) (.cse6 ((_ extract 31 0) .cse10))) (bvadd ((_ sign_extend 32) (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse6) .cse7 .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (concat .cse8 .cse6))))))))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3)))) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (not (bvsle c_~N~0 (_ bv0 32))) (or (= (let ((.cse17 (let ((.cse27 (store .cse28 .cse29 .cse30))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27))) (let ((.cse25 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (bvadd ((_ sign_extend 32) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse25 .cse7) (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse24 ((_ extract 31 0) .cse26)) (.cse23 ((_ extract 63 32) .cse26))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24) .cse7 .cse23))) (let ((.cse22 (bvadd (concat .cse23 .cse24) ((_ sign_extend 32) (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))))) (let ((.cse19 ((_ extract 31 0) .cse22)) (.cse18 ((_ extract 63 32) .cse22))) (bvadd (concat .cse18 .cse19) ((_ sign_extend 32) (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19) .cse7 .cse18)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))))))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17))) .cse2) .cse31 .cse32 .cse33) (or .cse31 .cse34 (= .cse2 (let ((.cse35 (let ((.cse45 (store .cse46 .cse29 .cse30))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse43 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (bvadd ((_ sign_extend 32) (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse43 .cse7) (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse42 ((_ extract 31 0) .cse44)) (.cse41 ((_ extract 63 32) .cse44))) (let ((.cse39 (store (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse42) .cse7 .cse41))) (let ((.cse40 (bvadd ((_ sign_extend 32) (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse39) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse41 .cse42)))) (let ((.cse37 ((_ extract 31 0) .cse40)) (.cse36 ((_ extract 63 32) .cse40))) (bvadd (concat .cse36 .cse37) ((_ sign_extend 32) (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse37) .cse7 .cse36)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35)))) .cse32 .cse33) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (= ((_ extract 31 0) (_ bv0 64)) (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (or .cse34 .cse48 .cse49 .cse33) .cse0 (or (= .cse2 (let ((.cse50 (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28))) (let ((.cse58 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse59 (bvadd (concat (select .cse58 .cse7) (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse57 ((_ extract 31 0) .cse59)) (.cse56 ((_ extract 63 32) .cse59))) (let ((.cse54 (store (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse57) .cse7 .cse56))) (let ((.cse55 (bvadd ((_ sign_extend 32) (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse56 .cse57)))) (let ((.cse52 ((_ extract 31 0) .cse55)) (.cse51 ((_ extract 63 32) .cse55))) (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse7 .cse51)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50)))) .cse48 .cse33) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (let ((.cse74 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse78)) (.cse76 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse78)) (.cse72 (bvadd |ULTIMATE.start_main_~a~0#1.offset| .cse78))) (let ((.cse73 (select .cse71 .cse72)) (.cse77 (select .cse71 .cse76)) (.cse75 (select .cse71 .cse74))) (or (= (let ((.cse60 (let ((.cse70 (store (store (store .cse71 .cse72 (bvadd .cse73 (_ bv5 32))) .cse74 (bvadd .cse75 (_ bv5 32))) .cse76 (bvadd .cse77 (_ bv5 32))))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse70))) (let ((.cse68 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse69 (bvadd (concat (select .cse68 .cse7) (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse70 |ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse67 ((_ extract 31 0) .cse69)) (.cse66 ((_ extract 63 32) .cse69))) (let ((.cse62 (store (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse67) .cse7 .cse66))) (let ((.cse65 (bvadd ((_ sign_extend 32) (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse62) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))) (concat .cse66 .cse67)))) (let ((.cse64 ((_ extract 63 32) .cse65)) (.cse63 ((_ extract 31 0) .cse65))) (bvadd ((_ sign_extend 32) (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse63) .cse7 .cse64)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|))) (concat .cse64 .cse63)))))))))))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse2) (not (= .cse73 (_ bv1 32))) (not (= .cse77 (_ bv1 32))) (not (= .cse75 (_ bv1 32))))))) .cse31) (= (select .cse47 .cse7) ((_ extract 63 32) (_ bv0 64))) (or .cse1 .cse48 .cse49 .cse33)))))))) is different from true [2022-12-13 20:02:56,444 WARN L233 SmtUtils]: Spent 10.79s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:02:59,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:54,469 WARN L233 SmtUtils]: Spent 52.48s on a formula simplification. DAG size of input: 134 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:03:59,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:03,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:21,147 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse33 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse63 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse33)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse15 (let ((.cse64 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse33))) (store .cse0 .cse64 (bvadd (select .cse0 .cse64) (_ bv5 32))))) (.cse62 (select .cse0 .cse63))) (let ((.cse16 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse29 (store .cse15 .cse63 (bvadd .cse62 (_ bv5 32)))) (.cse32 (not (= .cse62 (_ bv1 32)))) (.cse3 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32)))) (.cse17 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse34 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (bvslt (_ bv3 32) c_~N~0)) (= (select .cse0 .cse1) (_ bv6 32)) (= (_ bv6 32) (select .cse0 .cse2)) (not (bvsle c_~N~0 (_ bv0 32))) (or (= .cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse13 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (bvadd ((_ sign_extend 32) (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse13 .cse8) (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse12 ((_ extract 31 0) .cse14)) (.cse11 ((_ extract 63 32) .cse14))) (let ((.cse6 (store (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse12) .cse8 .cse11))) (let ((.cse10 (bvadd ((_ sign_extend 32) (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (concat .cse11 .cse12)))) (let ((.cse9 ((_ extract 63 32) .cse10)) (.cse7 ((_ extract 31 0) .cse10))) (bvadd ((_ sign_extend 32) (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse7) .cse8 .cse9)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (concat .cse9 .cse7))))))))))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4)))) .cse16) (bvslt (_ bv2 32) c_~N~0) (let ((.cse30 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse33))) (let ((.cse31 (select .cse0 .cse30))) (or .cse17 .cse16 (= .cse3 (let ((.cse18 (let ((.cse28 (store .cse29 .cse30 (bvadd .cse31 (_ bv5 32))))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28))) (let ((.cse26 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (bvadd ((_ sign_extend 32) (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse26 .cse8) (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse25 ((_ extract 31 0) .cse27)) (.cse24 ((_ extract 63 32) .cse27))) (let ((.cse22 (store (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse25) .cse8 .cse24))) (let ((.cse23 (bvadd ((_ sign_extend 32) (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse22) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (concat .cse24 .cse25)))) (let ((.cse20 ((_ extract 31 0) .cse23)) (.cse19 ((_ extract 63 32) .cse23))) (bvadd (concat .cse19 .cse20) ((_ sign_extend 32) (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20) .cse8 .cse19)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))))))))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18)))) (not (= .cse31 (_ bv1 32))) .cse32))) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (= ((_ extract 31 0) (_ bv0 64)) (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (or .cse16 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (= (let ((.cse35 (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29))) (let ((.cse43 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (bvadd (concat (select .cse43 .cse8) (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse42 ((_ extract 31 0) .cse44)) (.cse41 ((_ extract 63 32) .cse44))) (let ((.cse39 (store (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse42) .cse8 .cse41))) (let ((.cse40 (bvadd ((_ sign_extend 32) (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse39) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (concat .cse41 .cse42)))) (let ((.cse37 ((_ extract 31 0) .cse40)) (.cse36 ((_ extract 63 32) .cse40))) (bvadd (concat .cse36 .cse37) ((_ sign_extend 32) (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse37) .cse8 .cse36)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))))))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))) .cse3) .cse32) (bvule c_~N~0 (_ bv536870911 32)) (= (_ bv6 32) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (let ((.cse58 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse33)) (.cse60 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse33)) (.cse56 (bvadd |ULTIMATE.start_main_~a~0#1.offset| .cse33))) (let ((.cse57 (select .cse0 .cse56)) (.cse61 (select .cse0 .cse60)) (.cse59 (select .cse0 .cse58))) (or (= (let ((.cse45 (let ((.cse55 (store (store (store .cse0 .cse56 (bvadd .cse57 (_ bv5 32))) .cse58 (bvadd .cse59 (_ bv5 32))) .cse60 (bvadd .cse61 (_ bv5 32))))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55))) (let ((.cse53 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (bvadd (concat (select .cse53 .cse8) (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse55 |ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse52 ((_ extract 31 0) .cse54)) (.cse51 ((_ extract 63 32) .cse54))) (let ((.cse47 (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse8 .cse51))) (let ((.cse50 (bvadd ((_ sign_extend 32) (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse47) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))) (concat .cse51 .cse52)))) (let ((.cse49 ((_ extract 63 32) .cse50)) (.cse48 ((_ extract 31 0) .cse50))) (bvadd ((_ sign_extend 32) (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse48) .cse8 .cse49)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|))) (concat .cse49 .cse48)))))))))))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45))) .cse3) (not (= .cse57 (_ bv1 32))) (not (= .cse61 (_ bv1 32))) (not (= .cse59 (_ bv1 32))))))) .cse17) (= (select .cse34 .cse8) ((_ extract 63 32) (_ bv0 64)))))))) is different from true [2022-12-13 20:04:23,920 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse77 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse93 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse77)) (.cse70 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse90 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse77))) (let ((.cse78 (select .cse70 .cse90)) (.cse89 (select .cse70 .cse93))) (let ((.cse28 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse77)) (.cse15 (store .cse70 .cse93 (bvadd .cse89 (_ bv5 32)))) (.cse91 (bvadd .cse78 (_ bv5 32)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse10 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse45 (store .cse15 .cse90 .cse91)) (.cse1 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32)))) (.cse92 (select .cse70 .cse28))) (let ((.cse29 (bvadd .cse92 (_ bv5 32))) (.cse31 (not (= .cse92 (_ bv1 32)))) (.cse33 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse27 (store .cse70 .cse90 .cse91)) (.cse30 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse46 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse0 (not (= .cse89 (_ bv1 32)))) (.cse47 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse48 (= (let ((.cse79 (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse87 (select .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse88 (bvadd (concat (select .cse87 .cse6) (select .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse86 ((_ extract 31 0) .cse88)) (.cse85 ((_ extract 63 32) .cse88))) (let ((.cse83 (store (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse86) .cse6 .cse85))) (let ((.cse84 (bvadd ((_ sign_extend 32) (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse83) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse85 .cse86)))) (let ((.cse81 ((_ extract 31 0) .cse84)) (.cse80 ((_ extract 63 32) .cse84))) (bvadd (concat .cse80 .cse81) ((_ sign_extend 32) (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse81) .cse6 .cse80)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))) .cse1)) (.cse32 (not (= .cse78 (_ bv1 32))))) (and (not (bvslt (_ bv3 32) c_~N~0)) (or .cse0 (= .cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse13 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (bvadd ((_ sign_extend 32) (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse13 .cse6) (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse12 ((_ extract 31 0) .cse14)) (.cse11 ((_ extract 63 32) .cse14))) (let ((.cse4 (store (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse12) .cse6 .cse11))) (let ((.cse9 (bvadd ((_ sign_extend 32) (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse11 .cse12)))) (let ((.cse7 ((_ extract 63 32) .cse9)) (.cse5 ((_ extract 31 0) .cse9))) (bvadd ((_ sign_extend 32) (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse5) .cse6 .cse7)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (concat .cse7 .cse5))))))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2)))) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (not (bvsle c_~N~0 (_ bv0 32))) (or (= (let ((.cse16 (let ((.cse26 (store .cse27 .cse28 .cse29))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26))) (let ((.cse24 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (bvadd ((_ sign_extend 32) (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse24 .cse6) (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse23 ((_ extract 31 0) .cse25)) (.cse22 ((_ extract 63 32) .cse25))) (let ((.cse20 (store (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse23) .cse6 .cse22))) (let ((.cse21 (bvadd (concat .cse22 .cse23) ((_ sign_extend 32) (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse20) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))))) (let ((.cse18 ((_ extract 31 0) .cse21)) (.cse17 ((_ extract 63 32) .cse21))) (bvadd (concat .cse17 .cse18) ((_ sign_extend 32) (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse18) .cse6 .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))))))))))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))) .cse1) .cse30 .cse31 .cse32) (or .cse30 .cse33 (= .cse1 (let ((.cse34 (let ((.cse44 (store .cse45 .cse28 .cse29))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse44))) (let ((.cse42 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (bvadd ((_ sign_extend 32) (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse42 .cse6) (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse41 ((_ extract 31 0) .cse43)) (.cse40 ((_ extract 63 32) .cse43))) (let ((.cse38 (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse41) .cse6 .cse40))) (let ((.cse39 (bvadd ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse40 .cse41)))) (let ((.cse36 ((_ extract 31 0) .cse39)) (.cse35 ((_ extract 63 32) .cse39))) (bvadd (concat .cse35 .cse36) ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse36) .cse6 .cse35)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))))))))))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34)))) .cse31 .cse32) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (= ((_ extract 31 0) (_ bv0 64)) (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (or .cse33 .cse47 .cse48 .cse32) (bvule c_~N~0 (_ bv536870911 32)) (or (= .cse1 (let ((.cse49 (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27))) (let ((.cse57 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (bvadd (concat (select .cse57 .cse6) (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse6 .cse55))) (let ((.cse54 (bvadd ((_ sign_extend 32) (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse55 .cse56)))) (let ((.cse51 ((_ extract 31 0) .cse54)) (.cse50 ((_ extract 63 32) .cse54))) (bvadd (concat .cse50 .cse51) ((_ sign_extend 32) (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse51) .cse6 .cse50)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49)))) .cse47 .cse32) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (let ((.cse73 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse77)) (.cse75 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse77)) (.cse71 (bvadd |ULTIMATE.start_main_~a~0#1.offset| .cse77))) (let ((.cse72 (select .cse70 .cse71)) (.cse76 (select .cse70 .cse75)) (.cse74 (select .cse70 .cse73))) (or (= (let ((.cse59 (let ((.cse69 (store (store (store .cse70 .cse71 (bvadd .cse72 (_ bv5 32))) .cse73 (bvadd .cse74 (_ bv5 32))) .cse75 (bvadd .cse76 (_ bv5 32))))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse69))) (let ((.cse67 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (bvadd (concat (select .cse67 .cse6) (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse69 |ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse66 ((_ extract 31 0) .cse68)) (.cse65 ((_ extract 63 32) .cse68))) (let ((.cse61 (store (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse66) .cse6 .cse65))) (let ((.cse64 (bvadd ((_ sign_extend 32) (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))) (concat .cse65 .cse66)))) (let ((.cse63 ((_ extract 63 32) .cse64)) (.cse62 ((_ extract 31 0) .cse64))) (bvadd ((_ sign_extend 32) (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse62) .cse6 .cse63)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|))) (concat .cse63 .cse62)))))))))))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59))) .cse1) (not (= .cse72 (_ bv1 32))) (not (= .cse76 (_ bv1 32))) (not (= .cse74 (_ bv1 32))))))) .cse30) (= (select .cse46 .cse6) ((_ extract 63 32) (_ bv0 64))) (or .cse0 .cse47 .cse48 .cse32)))))))) is different from true [2022-12-13 20:04:26,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]