./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9bd2c7ff 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_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0490559c2bf039cbe49bd5644a18ada08843fe5179dc7b178541a9c54e014b6c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:57:08,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:57:08,616 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-19 07:57:08,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:57:08,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:57:08,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:57:08,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:57:08,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:57:08,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:57:08,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:57:08,684 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:57:08,685 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 07:57:08,686 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 07:57:08,688 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 07:57:08,688 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 07:57:08,689 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 07:57:08,689 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 07:57:08,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:57:08,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 07:57:08,691 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:57:08,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:57:08,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:57:08,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:57:08,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 07:57:08,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 07:57:08,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 07:57:08,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:57:08,695 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:57:08,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:57:08,696 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 07:57:08,697 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:57:08,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:57:08,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:57:08,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:57:08,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:57:08,699 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 07:57:08,699 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/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_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(F end) ) 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 -> 0490559c2bf039cbe49bd5644a18ada08843fe5179dc7b178541a9c54e014b6c [2023-11-19 07:57:09,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:57:09,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:57:09,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:57:09,074 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:57:09,074 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:57:09,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c [2023-11-19 07:57:12,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:57:12,670 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:57:12,671 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c [2023-11-19 07:57:12,689 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/data/674335f57/5a3f515c2a8f46da80f7c3d7f1bc72c4/FLAGc15100dd0 [2023-11-19 07:57:12,710 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/data/674335f57/5a3f515c2a8f46da80f7c3d7f1bc72c4 [2023-11-19 07:57:12,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:57:12,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:57:12,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:57:12,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:57:12,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:57:12,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:12" (1/1) ... [2023-11-19 07:57:12,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:12, skipping insertion in model container [2023-11-19 07:57:12,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:12" (1/1) ... [2023-11-19 07:57:12,809 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:57:13,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:57:13,107 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:57:13,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:57:13,198 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:57:13,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13 WrapperNode [2023-11-19 07:57:13,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:57:13,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:57:13,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:57:13,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:57:13,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (1/1) ... [2023-11-19 07:57:13,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (1/1) ... [2023-11-19 07:57:13,298 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 429 [2023-11-19 07:57:13,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:57:13,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:57:13,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:57:13,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:57:13,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (1/1) ... [2023-11-19 07:57:13,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (1/1) ... [2023-11-19 07:57:13,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (1/1) ... [2023-11-19 07:57:13,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (1/1) ... [2023-11-19 07:57:13,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (1/1) ... [2023-11-19 07:57:13,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (1/1) ... [2023-11-19 07:57:13,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (1/1) ... [2023-11-19 07:57:13,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (1/1) ... [2023-11-19 07:57:13,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:57:13,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:57:13,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:57:13,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:57:13,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (1/1) ... [2023-11-19 07:57:13,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:57:13,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:57:13,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:57:13,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-19 07:57:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:57:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:57:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:57:13,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:57:13,578 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:57:13,582 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:57:14,331 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:57:14,345 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:57:14,345 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:57:14,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:14 BoogieIcfgContainer [2023-11-19 07:57:14,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:57:14,352 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 07:57:14,353 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 07:57:14,357 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 07:57:14,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:57:14,359 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:57:12" (1/3) ... [2023-11-19 07:57:14,360 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@773023d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:57:14, skipping insertion in model container [2023-11-19 07:57:14,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:57:14,361 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:13" (2/3) ... [2023-11-19 07:57:14,361 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@773023d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:57:14, skipping insertion in model container [2023-11-19 07:57:14,361 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:57:14,361 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:14" (3/3) ... [2023-11-19 07:57:14,363 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c [2023-11-19 07:57:14,427 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 07:57:14,427 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 07:57:14,428 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 07:57:14,428 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 07:57:14,428 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 07:57:14,428 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 07:57:14,428 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 07:57:14,429 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 07:57:14,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 125 states, 124 states have (on average 1.7580645161290323) internal successors, (218), 124 states have internal predecessors, (218), 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) [2023-11-19 07:57:14,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2023-11-19 07:57:14,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:57:14,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:57:14,478 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:14,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:14,478 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 07:57:14,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 125 states, 124 states have (on average 1.7580645161290323) internal successors, (218), 124 states have internal predecessors, (218), 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) [2023-11-19 07:57:14,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2023-11-19 07:57:14,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:57:14,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:57:14,491 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:14,491 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:14,502 INFO L748 eck$LassoCheckResult]: Stem: 32#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 43#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 30#L241true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 26#L244-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 53#L254true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 56#L257-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 23#L267true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 11#L270-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 95#L280true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 75#L283-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 111#L293true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 74#L296-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 120#L306true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 14#L309-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 126#L319true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 103#L319-1true init_#res#1 := init_~tmp___5~0#1; 90#init_returnLabel#1true main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 44#L22true assume !(0 == assume_abort_if_not_~cond#1); 97#L21true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 73#L536-2true [2023-11-19 07:57:14,503 INFO L750 eck$LassoCheckResult]: Loop: 73#L536-2true assume !false;assume { :begin_inline_node1 } true; 54#L79true assume !(0 != ~mode1~0 % 256); 119#L107true assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2); 112#L107-1true ~mode1~0 := 1; 40#L79-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 87#L125true assume !(0 != ~mode2~0 % 256); 7#L153true assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 85#L153-1true ~mode2~0 := 1; 78#L125-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 107#L171true assume !(0 != ~mode3~0 % 256); 49#L199true assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 125#L199-1true ~mode3~0 := 1; 82#L171-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 41#L436true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 25#L436-1true check_#res#1 := check_~tmp~1#1; 13#check_returnLabel#1true main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 15#L565true assume !(0 == assert_~arg#1 % 256); 19#L560true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 73#L536-2true [2023-11-19 07:57:14,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times [2023-11-19 07:57:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:14,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588521463] [2023-11-19 07:57:14,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:14,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:15,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588521463] [2023-11-19 07:57:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588521463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:15,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:15,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:57:15,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921156179] [2023-11-19 07:57:15,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:15,017 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:57:15,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash 294943684, now seen corresponding path program 1 times [2023-11-19 07:57:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453763555] [2023-11-19 07:57:15,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:15,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:15,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453763555] [2023-11-19 07:57:15,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453763555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:15,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:15,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:57:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903542289] [2023-11-19 07:57:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:15,304 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:57:15,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:15,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:57:15,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:57:15,369 INFO L87 Difference]: Start difference. First operand has 125 states, 124 states have (on average 1.7580645161290323) internal successors, (218), 124 states have internal predecessors, (218), 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 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-11-19 07:57:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:15,481 INFO L93 Difference]: Finished difference Result 124 states and 213 transitions. [2023-11-19 07:57:15,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 213 transitions. [2023-11-19 07:57:15,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2023-11-19 07:57:15,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 201 transitions. [2023-11-19 07:57:15,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2023-11-19 07:57:15,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2023-11-19 07:57:15,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 201 transitions. [2023-11-19 07:57:15,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:15,501 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 201 transitions. [2023-11-19 07:57:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 201 transitions. [2023-11-19 07:57:15,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-19 07:57:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.6890756302521008) internal successors, (201), 118 states have internal predecessors, (201), 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) [2023-11-19 07:57:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 201 transitions. [2023-11-19 07:57:15,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 201 transitions. [2023-11-19 07:57:15,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:57:15,582 INFO L428 stractBuchiCegarLoop]: Abstraction has 119 states and 201 transitions. [2023-11-19 07:57:15,582 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 07:57:15,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 201 transitions. [2023-11-19 07:57:15,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2023-11-19 07:57:15,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:57:15,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:57:15,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:15,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:15,588 INFO L748 eck$LassoCheckResult]: Stem: 321#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 316#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 275#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 313#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 324#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 309#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 281#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 287#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 364#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 370#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 326#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 369#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 292#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 293#L319 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 268#L319-1 init_#res#1 := init_~tmp___5~0#1; 378#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 336#L22 assume !(0 == assume_abort_if_not_~cond#1); 337#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 300#L536-2 [2023-11-19 07:57:15,588 INFO L750 eck$LassoCheckResult]: Loop: 300#L536-2 assume !false;assume { :begin_inline_node1 } true; 348#L79 assume !(0 != ~mode1~0 % 256); 349#L107 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2); 380#L107-1 ~mode1~0 := 1; 332#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 333#L125 assume !(0 != ~mode2~0 % 256); 277#L153 assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 278#L153-1 ~mode2~0 := 1; 273#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 373#L171 assume !(0 != ~mode3~0 % 256); 340#L199 assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 341#L199-1 ~mode3~0 := 1; 362#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 334#L436 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 270#L437 assume ~st1~0 + ~nl1~0 <= 1; 271#L438 assume ~st2~0 + ~nl2~0 <= 1; 354#L439 assume ~st3~0 + ~nl3~0 <= 1; 355#L440 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 361#$Ultimate##256 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 297#$Ultimate##260 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 298#$Ultimate##264 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2;check_~tmp~1#1 := 1; 308#L436-1 check_#res#1 := check_~tmp~1#1; 289#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 290#L565 assume !(0 == assert_~arg#1 % 256); 291#L560 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 300#L536-2 [2023-11-19 07:57:15,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times [2023-11-19 07:57:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:15,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533444811] [2023-11-19 07:57:15,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:15,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:15,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533444811] [2023-11-19 07:57:15,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533444811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:15,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:15,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:57:15,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095762424] [2023-11-19 07:57:15,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:15,741 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:57:15,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1401663642, now seen corresponding path program 1 times [2023-11-19 07:57:15,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:15,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071234615] [2023-11-19 07:57:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:15,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:15,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071234615] [2023-11-19 07:57:15,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071234615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:15,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:15,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:57:15,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285130992] [2023-11-19 07:57:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:15,829 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:57:15,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:15,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:57:15,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:57:15,832 INFO L87 Difference]: Start difference. First operand 119 states and 201 transitions. cyclomatic complexity: 83 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-19 07:57:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:15,948 INFO L93 Difference]: Finished difference Result 122 states and 203 transitions. [2023-11-19 07:57:15,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 203 transitions. [2023-11-19 07:57:15,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2023-11-19 07:57:15,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 119 states and 174 transitions. [2023-11-19 07:57:15,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2023-11-19 07:57:15,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2023-11-19 07:57:15,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 174 transitions. [2023-11-19 07:57:15,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:15,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 174 transitions. [2023-11-19 07:57:15,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 174 transitions. [2023-11-19 07:57:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-19 07:57:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.4621848739495797) internal successors, (174), 118 states have internal predecessors, (174), 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) [2023-11-19 07:57:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2023-11-19 07:57:15,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 174 transitions. [2023-11-19 07:57:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:57:15,978 INFO L428 stractBuchiCegarLoop]: Abstraction has 119 states and 174 transitions. [2023-11-19 07:57:15,978 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 07:57:15,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 174 transitions. [2023-11-19 07:57:15,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2023-11-19 07:57:15,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:57:15,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:57:15,994 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:15,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:15,999 INFO L748 eck$LassoCheckResult]: Stem: 572#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 573#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 569#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 528#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 566#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 577#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 562#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 534#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 540#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 617#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 623#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 579#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 622#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 545#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 546#L319 assume ~id1~0 != ~id2~0; 627#L320 assume ~id1~0 != ~id3~0; 618#L321 assume ~id2~0 != ~id3~0; 619#L322 assume ~id1~0 >= 0; 521#L323 assume ~id2~0 >= 0; 522#L324 assume ~id3~0 >= 0; 541#L325 assume 0 == (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296); 568#L326 assume 0 == (if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296); 551#L327 assume 0 == (if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296); 552#L328 assume 0 != init_~r122~0#1 % 256; 581#L329 assume 0 != init_~r132~0#1 % 256; 582#L330 assume 0 != init_~r212~0#1 % 256; 538#L331 assume 0 != init_~r232~0#1 % 256; 539#L332 assume 0 != init_~r312~0#1 % 256; 567#L333 assume 0 != init_~r322~0#1 % 256; 580#L334 assume ~max1~0 == ~id1~0; 556#L335 assume ~max2~0 == ~id2~0; 557#L336 assume ~max3~0 == ~id3~0; 625#L337 assume 0 == ~st1~0; 596#L338 assume 0 == ~st2~0; 597#L339 assume 0 == ~st3~0; 635#L340 assume 0 == ~nl1~0; 630#L341 assume 0 == ~nl2~0; 583#L342 assume 0 == ~nl3~0; 584#L343 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 574#L344 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 575#L345 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1; 636#L319-1 init_#res#1 := init_~tmp___5~0#1; 631#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 589#L22 assume !(0 == assume_abort_if_not_~cond#1); 590#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 553#L536-2 [2023-11-19 07:57:16,000 INFO L750 eck$LassoCheckResult]: Loop: 553#L536-2 assume !false;assume { :begin_inline_node1 } true; 601#L79 assume !(0 != ~mode1~0 % 256); 602#L107 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2); 633#L107-1 ~mode1~0 := 1; 585#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 586#L125 assume !(0 != ~mode2~0 % 256); 530#L153 assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 531#L153-1 ~mode2~0 := 1; 526#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 626#L171 assume !(0 != ~mode3~0 % 256); 593#L199 assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 594#L199-1 ~mode3~0 := 1; 615#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 587#L436 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 523#L437 assume ~st1~0 + ~nl1~0 <= 1; 524#L438 assume ~st2~0 + ~nl2~0 <= 1; 607#L439 assume ~st3~0 + ~nl3~0 <= 1; 608#L440 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 614#$Ultimate##256 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 548#$Ultimate##260 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 549#$Ultimate##264 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2;check_~tmp~1#1 := 1; 561#L436-1 check_#res#1 := check_~tmp~1#1; 542#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 543#L565 assume !(0 == assert_~arg#1 % 256); 544#L560 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 553#L536-2 [2023-11-19 07:57:16,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times [2023-11-19 07:57:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:16,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644436223] [2023-11-19 07:57:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:16,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:57:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:16,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:57:16,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:16,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1401663642, now seen corresponding path program 2 times [2023-11-19 07:57:16,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:16,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231531924] [2023-11-19 07:57:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:16,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:16,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:16,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231531924] [2023-11-19 07:57:16,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231531924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:16,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:16,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:57:16,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604127733] [2023-11-19 07:57:16,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:16,195 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:57:16,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:16,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:57:16,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:57:16,196 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2023-11-19 07:57:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:16,242 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2023-11-19 07:57:16,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 248 transitions. [2023-11-19 07:57:16,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2023-11-19 07:57:16,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 248 transitions. [2023-11-19 07:57:16,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2023-11-19 07:57:16,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2023-11-19 07:57:16,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 248 transitions. [2023-11-19 07:57:16,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:16,250 INFO L218 hiAutomatonCegarLoop]: Abstraction has 169 states and 248 transitions. [2023-11-19 07:57:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 248 transitions. [2023-11-19 07:57:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2023-11-19 07:57:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.467065868263473) internal successors, (245), 166 states have internal predecessors, (245), 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) [2023-11-19 07:57:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2023-11-19 07:57:16,261 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 245 transitions. [2023-11-19 07:57:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:57:16,263 INFO L428 stractBuchiCegarLoop]: Abstraction has 167 states and 245 transitions. [2023-11-19 07:57:16,263 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 07:57:16,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 245 transitions. [2023-11-19 07:57:16,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2023-11-19 07:57:16,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:57:16,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:57:16,266 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:16,267 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:16,267 INFO L748 eck$LassoCheckResult]: Stem: 866#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 867#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 865#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 822#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 859#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 871#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 858#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 828#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 834#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 913#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 919#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 873#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 918#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 839#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 840#L319 assume ~id1~0 != ~id2~0; 923#L320 assume ~id1~0 != ~id3~0; 914#L321 assume ~id2~0 != ~id3~0; 915#L322 assume ~id1~0 >= 0; 815#L323 assume ~id2~0 >= 0; 816#L324 assume ~id3~0 >= 0; 835#L325 assume 0 == (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296); 861#L326 assume 0 == (if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296); 844#L327 assume 0 == (if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296); 845#L328 assume 0 != init_~r122~0#1 % 256; 875#L329 assume 0 != init_~r132~0#1 % 256; 876#L330 assume 0 != init_~r212~0#1 % 256; 832#L331 assume 0 != init_~r232~0#1 % 256; 833#L332 assume 0 != init_~r312~0#1 % 256; 860#L333 assume 0 != init_~r322~0#1 % 256; 874#L334 assume ~max1~0 == ~id1~0; 849#L335 assume ~max2~0 == ~id2~0; 850#L336 assume ~max3~0 == ~id3~0; 921#L337 assume 0 == ~st1~0; 892#L338 assume 0 == ~st2~0; 893#L339 assume 0 == ~st3~0; 932#L340 assume 0 == ~nl1~0; 926#L341 assume 0 == ~nl2~0; 877#L342 assume 0 == ~nl3~0; 878#L343 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 868#L344 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 869#L345 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1; 935#L319-1 init_#res#1 := init_~tmp___5~0#1; 927#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 883#L22 assume !(0 == assume_abort_if_not_~cond#1); 884#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 846#L536-2 [2023-11-19 07:57:16,268 INFO L750 eck$LassoCheckResult]: Loop: 846#L536-2 assume !false;assume { :begin_inline_node1 } true; 896#L79 assume !(0 != ~mode1~0 % 256); 897#L107 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 847#L108 assume 0 != ~ep12~0 % 256;~p12_new~0 := (if (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 <= 127 then (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 else (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 - 256); 848#L108-2 assume 0 != ~ep13~0 % 256;~p13_new~0 := (if (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 <= 127 then (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 else (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 - 256); 929#L107-1 ~mode1~0 := 1; 879#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 880#L125 assume !(0 != ~mode2~0 % 256); 824#L153 assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 825#L153-1 ~mode2~0 := 1; 820#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 922#L171 assume !(0 != ~mode3~0 % 256); 889#L199 assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 890#L199-1 ~mode3~0 := 1; 957#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 956#L436 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 955#L437 assume ~st1~0 + ~nl1~0 <= 1; 954#L438 assume ~st2~0 + ~nl2~0 <= 1; 953#L439 assume ~st3~0 + ~nl3~0 <= 1; 952#L440 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2); 909#L443 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 910#$Ultimate##256 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 946#$Ultimate##260 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2); 885#L453 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 886#$Ultimate##264 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2;check_~tmp~1#1 := 1; 857#L436-1 check_#res#1 := check_~tmp~1#1; 836#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 837#L565 assume !(0 == assert_~arg#1 % 256); 838#L560 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 846#L536-2 [2023-11-19 07:57:16,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times [2023-11-19 07:57:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:16,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601644484] [2023-11-19 07:57:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:16,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:57:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:16,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:57:16,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash -674736526, now seen corresponding path program 1 times [2023-11-19 07:57:16,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:16,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841504771] [2023-11-19 07:57:16,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:16,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:16,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:57:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:16,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:57:16,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:16,413 INFO L85 PathProgramCache]: Analyzing trace with hash 277711156, now seen corresponding path program 1 times [2023-11-19 07:57:16,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:16,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726843106] [2023-11-19 07:57:16,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:16,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:16,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726843106] [2023-11-19 07:57:16,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726843106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:16,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:16,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:57:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066090083] [2023-11-19 07:57:16,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:18,617 INFO L210 LassoAnalysis]: Preferences: [2023-11-19 07:57:18,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-19 07:57:18,618 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-19 07:57:18,618 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-19 07:57:18,618 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-19 07:57:18,618 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:57:18,619 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-19 07:57:18,619 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-19 07:57:18,619 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2023-11-19 07:57:18,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-19 07:57:18,619 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-19 07:57:18,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:18,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:18,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:18,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:18,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:18,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:18,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:18,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:18,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:18,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:19,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:19,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:19,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:19,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:19,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:19,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:20,364 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2023-11-19 07:57:20,581 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 6438 conjunctions. This might take some time... [2023-11-19 07:57:21,700 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 723 conjunctions. [2023-11-19 07:57:54,611 WARN L293 SmtUtils]: Spent 32.81s on a formula simplification. DAG size of input: 825 DAG size of output: 136 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2023-11-19 07:57:54,681 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-19 07:57:54,682 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-19 07:57:54,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:57:54,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:57:54,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:57:54,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-19 07:57:54,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-19 07:57:54,698 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-19 07:57:54,726 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-19 07:57:54,726 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=-108} Honda state: {~ep12~0=-108} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-19 07:57:54,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:57:54,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:57:54,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:57:54,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:57:54,761 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-19 07:57:54,761 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-19 07:57:54,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-19 07:57:54,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:57:54,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:57:54,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:57:54,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:57:54,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-19 07:57:54,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-19 07:57:54,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-19 07:57:54,949 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-19 07:57:54,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a3ed55e-0f1c-40d1-9446-454778fd0826/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:57:54,953 INFO L210 LassoAnalysis]: Preferences: [2023-11-19 07:57:54,954 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-19 07:57:54,954 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-19 07:57:54,954 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-19 07:57:54,954 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-19 07:57:54,954 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:57:54,954 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-19 07:57:54,954 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-19 07:57:54,954 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2023-11-19 07:57:54,954 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-19 07:57:54,954 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-19 07:57:54,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:54,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:54,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:54,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:54,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:55,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:55,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:55,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:55,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:55,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:55,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:55,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:55,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:55,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:55,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:55,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:57:56,519 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2023-11-19 07:57:56,691 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 5152 conjunctions. This might take some time... [2023-11-19 07:57:57,470 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 723 conjunctions.