./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx --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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:14:54,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:14:54,759 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 22:14:54,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:14:54,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:14:54,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:14:54,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:14:54,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:14:54,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:14:54,829 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:14:54,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:14:54,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:14:54,831 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:14:54,834 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 22:14:54,834 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 22:14:54,835 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 22:14:54,835 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 22:14:54,836 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 22:14:54,836 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 22:14:54,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:14:54,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 22:14:54,837 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:14:54,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:14:54,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:14:54,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:14:54,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 22:14:54,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 22:14:54,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 22:14:54,840 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:14:54,841 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:14:54,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:14:54,843 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 22:14:54,843 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:14:54,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:14:54,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:14:54,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:14:54,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:14:54,845 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 22:14:54,845 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_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/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_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx 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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2023-11-21 22:14:55,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:14:55,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:14:55,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:14:55,257 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:14:55,258 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:14:55,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/systemc/toy.cil.c [2023-11-21 22:14:58,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:14:58,781 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:14:58,781 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/sv-benchmarks/c/systemc/toy.cil.c [2023-11-21 22:14:58,810 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/data/e1584ea00/e040a8206c2747c2b8acd4f1ecee6d3a/FLAGa7d62b3b1 [2023-11-21 22:14:58,834 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/data/e1584ea00/e040a8206c2747c2b8acd4f1ecee6d3a [2023-11-21 22:14:58,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:14:58,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:14:58,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:58,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:14:58,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:14:58,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:58" (1/1) ... [2023-11-21 22:14:58,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc13358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:58, skipping insertion in model container [2023-11-21 22:14:58,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:58" (1/1) ... [2023-11-21 22:14:58,897 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:14:59,127 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:59,141 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:14:59,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:59,207 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:14:59,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59 WrapperNode [2023-11-21 22:14:59,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:59,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:59,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:14:59,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:14:59,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,259 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 362 [2023-11-21 22:14:59,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:59,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:14:59,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:14:59,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:14:59,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,286 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,300 INFO L187 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-21 22:14:59,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:14:59,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:14:59,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:14:59,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:14:59,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (1/1) ... [2023-11-21 22:14:59,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:14:59,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:59,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:14:59,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 22:14:59,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:14:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:14:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:14:59,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:14:59,575 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:14:59,578 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:15:00,111 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:15:00,126 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:15:00,134 INFO L308 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-21 22:15:00,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:15:00 BoogieIcfgContainer [2023-11-21 22:15:00,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:15:00,137 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 22:15:00,137 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 22:15:00,141 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 22:15:00,141 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:15:00,142 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 10:14:58" (1/3) ... [2023-11-21 22:15:00,143 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f708322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:15:00, skipping insertion in model container [2023-11-21 22:15:00,143 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:15:00,143 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:59" (2/3) ... [2023-11-21 22:15:00,144 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f708322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:15:00, skipping insertion in model container [2023-11-21 22:15:00,144 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:15:00,144 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:15:00" (3/3) ... [2023-11-21 22:15:00,145 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2023-11-21 22:15:00,209 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 22:15:00,210 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 22:15:00,210 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 22:15:00,210 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 22:15:00,210 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 22:15:00,210 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 22:15:00,210 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 22:15:00,211 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 22:15:00,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 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-21 22:15:00,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2023-11-21 22:15:00,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:00,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:00,253 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] [2023-11-21 22:15:00,254 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] [2023-11-21 22:15:00,254 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 22:15:00,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 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-21 22:15:00,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2023-11-21 22:15:00,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:00,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:00,268 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] [2023-11-21 22:15:00,269 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] [2023-11-21 22:15:00,279 INFO L748 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 39#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 106#L408true assume !(1 == ~c_req_up~0); 85#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 127#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 126#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 60#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 121#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 43#L439-1true assume !(0 == ~e_f~0); 5#L444-1true assume !(0 == ~e_g~0); 98#L449-1true assume !(0 == ~e_e~0); 53#L454-1true assume !(0 == ~e_c~0); 111#L459-1true assume !(0 == ~e_wl~0); 25#L464-1true assume !(1 == ~wl_pc~0); 100#$Ultimate##44true assume !(2 == ~wl_pc~0); 23#L477true assume !(1 == ~c1_pc~0); 18#L487true assume !(1 == ~c2_pc~0); 87#L496true assume !(1 == ~wb_pc~0); 29#L505true assume !(1 == ~e_c~0); 36#L514-1true assume !(1 == ~e_e~0); 133#L519-1true assume !(1 == ~e_f~0); 40#L524-1true assume !(1 == ~e_g~0); 131#L529-1true assume !(1 == ~e_c~0); 2#L534-1true assume !(1 == ~e_wl~0); 4#L676-1true [2023-11-21 22:15:00,281 INFO L750 eck$LassoCheckResult]: Loop: 4#L676-1true assume !false; 35#L546true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 70#L381true assume !true; 90#eval_returnLabel#1true havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 42#L552true assume !(1 == ~c_req_up~0); 59#L552-2true start_simulation_~kernel_st~0#1 := 3; 14#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 17#L564-2true assume 0 == ~e_g~0;~e_g~0 := 1; 6#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 130#L574-1true assume 0 == ~e_c~0;~e_c~0 := 1; 10#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 94#L584-1true assume 1 == ~wl_pc~0; 46#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 113#L597true assume !(1 == ~c1_pc~0); 27#L607true assume !(1 == ~c2_pc~0); 103#L616true assume !(1 == ~wb_pc~0); 123#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 52#L639-1true assume 1 == ~e_f~0;~e_f~0 := 2; 117#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 77#L649-1true assume 1 == ~e_c~0;~e_c~0 := 2; 41#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 21#L659-1true assume 0 == ~wl_st~0; 4#L676-1true [2023-11-21 22:15:00,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2023-11-21 22:15:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:00,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539416713] [2023-11-21 22:15:00,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:00,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:00,655 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-21 22:15:00,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:00,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539416713] [2023-11-21 22:15:00,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539416713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:00,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:00,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891553161] [2023-11-21 22:15:00,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:00,664 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:15:00,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1307375692, now seen corresponding path program 1 times [2023-11-21 22:15:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:00,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119909658] [2023-11-21 22:15:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:00,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:00,686 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-21 22:15:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119909658] [2023-11-21 22:15:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119909658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:15:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365802499] [2023-11-21 22:15:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:00,690 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:15:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:00,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:15:00,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:15:00,735 INFO L87 Difference]: Start difference. First operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-21 22:15:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:00,757 INFO L93 Difference]: Finished difference Result 130 states and 224 transitions. [2023-11-21 22:15:00,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 224 transitions. [2023-11-21 22:15:00,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2023-11-21 22:15:00,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 219 transitions. [2023-11-21 22:15:00,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2023-11-21 22:15:00,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2023-11-21 22:15:00,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 219 transitions. [2023-11-21 22:15:00,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:15:00,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2023-11-21 22:15:00,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 219 transitions. [2023-11-21 22:15:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-21 22:15:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.752) internal successors, (219), 124 states have internal predecessors, (219), 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-21 22:15:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 219 transitions. [2023-11-21 22:15:00,827 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2023-11-21 22:15:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:15:00,832 INFO L428 stractBuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2023-11-21 22:15:00,832 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 22:15:00,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 219 transitions. [2023-11-21 22:15:00,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2023-11-21 22:15:00,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:00,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:00,837 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] [2023-11-21 22:15:00,837 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] [2023-11-21 22:15:00,838 INFO L748 eck$LassoCheckResult]: Stem: 314#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 344#L408 assume !(1 == ~c_req_up~0); 307#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 384#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 395#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 369#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 370#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 351#L439-1 assume !(0 == ~e_f~0); 274#L444-1 assume !(0 == ~e_g~0); 275#L449-1 assume !(0 == ~e_e~0); 364#L454-1 assume !(0 == ~e_c~0); 365#L459-1 assume !(0 == ~e_wl~0); 316#L464-1 assume !(1 == ~wl_pc~0); 317#$Ultimate##44 assume !(2 == ~wl_pc~0); 312#L477 assume !(1 == ~c1_pc~0); 300#L487 assume !(1 == ~c2_pc~0); 302#L496 assume !(1 == ~wb_pc~0); 328#L505 assume !(1 == ~e_c~0); 329#L514-1 assume !(1 == ~e_e~0); 340#L519-1 assume !(1 == ~e_f~0); 346#L524-1 assume !(1 == ~e_g~0); 347#L529-1 assume !(1 == ~e_c~0); 271#L534-1 assume !(1 == ~e_wl~0); 272#L676-1 [2023-11-21 22:15:00,838 INFO L750 eck$LassoCheckResult]: Loop: 272#L676-1 assume !false; 273#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 298#L381 assume !false; 341#L299 assume !(0 == ~wl_st~0); 342#L303 assume !(0 == ~c1_st~0); 394#L306 assume !(0 == ~c2_st~0); 387#L309 assume !(0 == ~wb_st~0); 388#L312 assume !(0 == ~r_st~0); 389#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 348#L552 assume !(1 == ~c_req_up~0); 349#L552-2 start_simulation_~kernel_st~0#1 := 3; 295#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 296#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 276#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 277#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 286#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 287#L584-1 assume 1 == ~wl_pc~0; 355#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 356#L597 assume !(1 == ~c1_pc~0); 322#L607 assume !(1 == ~c2_pc~0); 323#L616 assume !(1 == ~wb_pc~0); 376#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 368#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 362#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 363#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 377#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 345#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 308#L659-1 assume 0 == ~wl_st~0; 272#L676-1 [2023-11-21 22:15:00,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2023-11-21 22:15:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414775063] [2023-11-21 22:15:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:00,931 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-21 22:15:00,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:00,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414775063] [2023-11-21 22:15:00,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414775063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:00,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:00,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:00,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5866584] [2023-11-21 22:15:00,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:00,933 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:15:00,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:00,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1329201933, now seen corresponding path program 1 times [2023-11-21 22:15:00,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:00,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874023457] [2023-11-21 22:15:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:00,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:00,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:00,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:01,371 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:15:01,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:15:01,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:15:01,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:15:01,372 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-21 22:15:01,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:01,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:15:01,373 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:15:01,373 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration2_Loop [2023-11-21 22:15:01,373 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:15:01,373 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:15:01,391 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-21 22:15:01,402 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-21 22:15:01,408 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-21 22:15:01,412 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-21 22:15:01,415 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-21 22:15:01,421 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-21 22:15:01,424 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-21 22:15:01,427 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-21 22:15:01,430 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-21 22:15:01,433 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-21 22:15:01,436 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-21 22:15:01,439 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-21 22:15:01,441 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-21 22:15:01,447 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-21 22:15:01,451 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-21 22:15:01,454 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-21 22:15:01,457 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-21 22:15:01,463 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-21 22:15:01,467 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-21 22:15:01,473 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-21 22:15:01,475 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-21 22:15:01,479 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-21 22:15:01,485 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-21 22:15:01,488 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-21 22:15:01,490 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-21 22:15:01,496 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-21 22:15:01,772 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:15:01,773 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-21 22:15:01,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:01,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:01,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:01,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-21 22:15:01,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:15:01,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:01,821 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 22:15:01,821 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-21 22:15:01,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:01,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:01,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:01,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:01,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:15:01,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:01,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-21 22:15:01,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:01,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:01,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:01,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:01,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-21 22:15:01,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:01,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-21 22:15:01,944 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-21 22:15:01,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:01,968 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:15:01,968 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:15:01,968 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:15:01,969 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:15:01,969 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:15:01,969 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:01,969 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:15:01,969 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:15:01,969 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration2_Loop [2023-11-21 22:15:01,969 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:15:01,969 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:15:01,972 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-21 22:15:01,979 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-21 22:15:01,986 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-21 22:15:01,990 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-21 22:15:01,994 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-21 22:15:01,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-21 22:15:02,002 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-21 22:15:02,009 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-21 22:15:02,014 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-21 22:15:02,017 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-21 22:15:02,021 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-21 22:15:02,023 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-21 22:15:02,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-21 22:15:02,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-21 22:15:02,038 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-21 22:15:02,043 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-21 22:15:02,046 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-21 22:15:02,053 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-21 22:15:02,056 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-21 22:15:02,063 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-21 22:15:02,074 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-21 22:15:02,076 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-21 22:15:02,079 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-21 22:15:02,085 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-21 22:15:02,088 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-21 22:15:02,090 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-21 22:15:02,360 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:15:02,365 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:15:02,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:02,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:02,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:02,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:15:02,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:15:02,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:15:02,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:15:02,394 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-21 22:15:02,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:15:02,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-21 22:15:02,405 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-21 22:15:02,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:15:02,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:15:02,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:02,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:02,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:02,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:02,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:15:02,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:15:02,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:15:02,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:15:02,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:15:02,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:15:02,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-21 22:15:02,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:15:02,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:15:02,478 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:15:02,482 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-21 22:15:02,482 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-21 22:15:02,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:02,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:02,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:02,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-21 22:15:02,520 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:15:02,521 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-21 22:15:02,521 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:15:02,521 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2023-11-21 22:15:02,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:02,545 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-21 22:15:02,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:02,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:15:02,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:15:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:02,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:15:02,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:15:02,817 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-21 22:15:02,821 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-21 22:15:02,822 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 219 transitions. cyclomatic complexity: 95 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:15:02,933 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 219 transitions. cyclomatic complexity: 95. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 413 states and 711 transitions. Complement of second has 5 states. [2023-11-21 22:15:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-21 22:15:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:15:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-11-21 22:15:02,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 24 letters. Loop has 28 letters. [2023-11-21 22:15:02,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:15:02,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 52 letters. Loop has 28 letters. [2023-11-21 22:15:02,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:15:02,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 24 letters. Loop has 56 letters. [2023-11-21 22:15:02,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:15:02,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 413 states and 711 transitions. [2023-11-21 22:15:02,957 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 282 [2023-11-21 22:15:02,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 413 states to 413 states and 711 transitions. [2023-11-21 22:15:02,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 314 [2023-11-21 22:15:02,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2023-11-21 22:15:02,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 711 transitions. [2023-11-21 22:15:02,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:02,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 413 states and 711 transitions. [2023-11-21 22:15:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 711 transitions. [2023-11-21 22:15:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 316. [2023-11-21 22:15:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7278481012658229) internal successors, (546), 315 states have internal predecessors, (546), 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-21 22:15:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 546 transitions. [2023-11-21 22:15:02,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 546 transitions. [2023-11-21 22:15:02,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:02,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:15:02,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:15:02,997 INFO L87 Difference]: Start difference. First operand 316 states and 546 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:15:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:03,019 INFO L93 Difference]: Finished difference Result 316 states and 545 transitions. [2023-11-21 22:15:03,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 545 transitions. [2023-11-21 22:15:03,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-21 22:15:03,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 545 transitions. [2023-11-21 22:15:03,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2023-11-21 22:15:03,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2023-11-21 22:15:03,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 545 transitions. [2023-11-21 22:15:03,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:03,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2023-11-21 22:15:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 545 transitions. [2023-11-21 22:15:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2023-11-21 22:15:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7246835443037976) internal successors, (545), 315 states have internal predecessors, (545), 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-21 22:15:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 545 transitions. [2023-11-21 22:15:03,073 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2023-11-21 22:15:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:15:03,075 INFO L428 stractBuchiCegarLoop]: Abstraction has 316 states and 545 transitions. [2023-11-21 22:15:03,075 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 22:15:03,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 545 transitions. [2023-11-21 22:15:03,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-21 22:15:03,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:03,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:03,079 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] [2023-11-21 22:15:03,079 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] [2023-11-21 22:15:03,080 INFO L748 eck$LassoCheckResult]: Stem: 1696#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1697#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1748#L408 assume !(1 == ~c_req_up~0); 1685#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1830#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 1851#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1795#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 1796#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1760#L439-1 assume !(0 == ~e_f~0); 1624#L444-1 assume !(0 == ~e_g~0); 1625#L449-1 assume !(0 == ~e_e~0); 1785#L454-1 assume !(0 == ~e_c~0); 1786#L459-1 assume !(0 == ~e_wl~0); 1698#L464-1 assume !(1 == ~wl_pc~0); 1699#$Ultimate##44 assume !(2 == ~wl_pc~0); 1694#L477 assume !(1 == ~c1_pc~0); 1675#L487 assume !(1 == ~c2_pc~0); 1677#L496 assume !(1 == ~wb_pc~0); 1719#L505 assume !(1 == ~e_c~0); 1720#L514-1 assume !(1 == ~e_e~0); 1741#L519-1 assume !(1 == ~e_f~0); 1752#L524-1 assume !(1 == ~e_g~0); 1753#L529-1 assume !(1 == ~e_c~0); 1617#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1618#L676-1 [2023-11-21 22:15:03,080 INFO L750 eck$LassoCheckResult]: Loop: 1618#L676-1 assume !false; 1867#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1807#L381 assume !false; 1742#L299 assume !(0 == ~wl_st~0); 1743#L303 assume !(0 == ~c1_st~0); 1852#L306 assume !(0 == ~c2_st~0); 1834#L309 assume !(0 == ~wb_st~0); 1835#L312 assume !(0 == ~r_st~0); 1853#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1859#L552 assume !(1 == ~c_req_up~0); 1794#L552-2 start_simulation_~kernel_st~0#1 := 3; 1664#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1665#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1674#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1855#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1856#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1902#L584-1 assume 1 == ~wl_pc~0; 1900#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1898#L597 assume !(1 == ~c1_pc~0); 1894#L607 assume !(1 == ~c2_pc~0); 1889#L616 assume !(1 == ~wb_pc~0); 1888#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1884#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1781#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1782#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1846#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1749#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1750#L659-1 assume 0 == ~wl_st~0; 1618#L676-1 [2023-11-21 22:15:03,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779217, now seen corresponding path program 1 times [2023-11-21 22:15:03,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:03,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446708605] [2023-11-21 22:15:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:03,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-21 22:15:03,190 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-21 22:15:03,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:03,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446708605] [2023-11-21 22:15:03,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446708605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:03,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:03,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:03,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503615311] [2023-11-21 22:15:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:03,192 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:15:03,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:03,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1329201933, now seen corresponding path program 2 times [2023-11-21 22:15:03,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:03,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550904416] [2023-11-21 22:15:03,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:03,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:03,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:03,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:03,507 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:15:03,507 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:15:03,507 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:15:03,508 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:15:03,508 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-21 22:15:03,508 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:03,508 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:15:03,508 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:15:03,508 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration3_Loop [2023-11-21 22:15:03,508 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:15:03,509 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:15:03,517 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-21 22:15:03,521 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-21 22:15:03,524 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-21 22:15:03,527 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-21 22:15:03,531 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-21 22:15:03,535 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-21 22:15:03,541 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-21 22:15:03,544 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-21 22:15:03,554 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-21 22:15:03,561 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-21 22:15:03,564 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-21 22:15:03,571 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-21 22:15:03,580 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-21 22:15:03,583 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-21 22:15:03,589 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-21 22:15:03,592 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-21 22:15:03,595 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-21 22:15:03,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-21 22:15:03,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-21 22:15:03,604 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-21 22:15:03,607 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-21 22:15:03,613 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-21 22:15:03,616 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-21 22:15:03,620 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-21 22:15:03,623 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-21 22:15:03,629 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-21 22:15:03,919 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:15:03,920 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-21 22:15:03,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:03,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:03,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:03,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:15:03,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:03,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-21 22:15:03,968 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 22:15:03,969 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-21 22:15:03,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:03,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:03,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:03,996 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:04,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:15:04,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:04,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-21 22:15:04,025 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 22:15:04,026 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-21 22:15:04,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:04,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:04,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:04,054 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:04,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:15:04,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:04,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-21 22:15:04,101 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 22:15:04,101 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet8#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-21 22:15:04,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:04,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:04,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:04,128 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:04,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-21 22:15:04,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:15:04,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:04,160 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 22:15:04,160 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-21 22:15:04,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:04,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:04,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:04,187 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:04,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:15:04,193 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:04,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-21 22:15:04,220 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 22:15:04,221 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-21 22:15:04,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:04,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:04,250 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:04,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-21 22:15:04,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:15:04,257 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:04,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:04,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:04,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:04,314 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:04,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-21 22:15:04,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-21 22:15:04,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:04,360 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-21 22:15:04,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:04,386 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:15:04,386 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:15:04,386 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:15:04,386 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:15:04,386 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:15:04,386 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:04,386 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:15:04,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:15:04,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration3_Loop [2023-11-21 22:15:04,387 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:15:04,387 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:15:04,389 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-21 22:15:04,392 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-21 22:15:04,395 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-21 22:15:04,399 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-21 22:15:04,401 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-21 22:15:04,404 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-21 22:15:04,410 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-21 22:15:04,413 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-21 22:15:04,421 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-21 22:15:04,427 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-21 22:15:04,430 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-21 22:15:04,436 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-21 22:15:04,438 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-21 22:15:04,441 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-21 22:15:04,443 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-21 22:15:04,449 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-21 22:15:04,451 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-21 22:15:04,453 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-21 22:15:04,457 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-21 22:15:04,460 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-21 22:15:04,466 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-21 22:15:04,469 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-21 22:15:04,472 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-21 22:15:04,475 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-21 22:15:04,478 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-21 22:15:04,484 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-21 22:15:04,719 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:15:04,719 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:15:04,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:04,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:04,720 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:04,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:15:04,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-21 22:15:04,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:15:04,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:15:04,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:15:04,744 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-21 22:15:04,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:15:04,752 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-21 22:15:04,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:15:04,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:15:04,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:04,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:04,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:04,794 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:04,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:15:04,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-21 22:15:04,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:15:04,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:15:04,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:15:04,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:15:04,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:15:04,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:15:04,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:15:04,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:15:04,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:04,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:04,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:04,853 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:04,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:15:04,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:15:04,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:15:04,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:15:04,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:15:04,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:15:04,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-21 22:15:04,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:15:04,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:15:04,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:15:04,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:04,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:04,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:04,906 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:04,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-21 22:15:04,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:15:04,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:15:04,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:15:04,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:15:04,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:15:04,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:15:04,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:15:04,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:15:04,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:15:04,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:04,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:04,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:04,939 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:04,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-21 22:15:04,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:15:04,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:15:04,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:15:04,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:15:04,954 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-21 22:15:04,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:15:04,955 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-21 22:15:04,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:15:04,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:15:05,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:05,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:05,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:05,017 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:05,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:15:05,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-21 22:15:05,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:15:05,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:15:05,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:15:05,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:15:05,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:15:05,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:15:05,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:15:05,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:15:05,071 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-21 22:15:05,071 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-21 22:15:05,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:05,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:05,077 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:05,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-21 22:15:05,079 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:15:05,079 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-21 22:15:05,079 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:15:05,080 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2023-11-21 22:15:05,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:05,098 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-21 22:15:05,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:05,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:15:05,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:15:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:15:05,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:15:05,372 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-21 22:15:05,374 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-21 22:15:05,374 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 316 states and 545 transitions. cyclomatic complexity: 232 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:15:05,455 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 316 states and 545 transitions. cyclomatic complexity: 232. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 604 states and 1037 transitions. Complement of second has 5 states. [2023-11-21 22:15:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-21 22:15:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:15:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-11-21 22:15:05,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 24 letters. Loop has 28 letters. [2023-11-21 22:15:05,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:15:05,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 52 letters. Loop has 28 letters. [2023-11-21 22:15:05,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:15:05,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 24 letters. Loop has 56 letters. [2023-11-21 22:15:05,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:15:05,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 1037 transitions. [2023-11-21 22:15:05,475 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 376 [2023-11-21 22:15:05,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 604 states and 1037 transitions. [2023-11-21 22:15:05,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2023-11-21 22:15:05,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2023-11-21 22:15:05,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 1037 transitions. [2023-11-21 22:15:05,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:05,485 INFO L218 hiAutomatonCegarLoop]: Abstraction has 604 states and 1037 transitions. [2023-11-21 22:15:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 1037 transitions. [2023-11-21 22:15:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 316. [2023-11-21 22:15:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7246835443037976) internal successors, (545), 315 states have internal predecessors, (545), 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-21 22:15:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 545 transitions. [2023-11-21 22:15:05,502 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2023-11-21 22:15:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:15:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:15:05,504 INFO L87 Difference]: Start difference. First operand 316 states and 545 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:15:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:05,529 INFO L93 Difference]: Finished difference Result 316 states and 544 transitions. [2023-11-21 22:15:05,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 544 transitions. [2023-11-21 22:15:05,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-21 22:15:05,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 544 transitions. [2023-11-21 22:15:05,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2023-11-21 22:15:05,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2023-11-21 22:15:05,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 544 transitions. [2023-11-21 22:15:05,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:05,544 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 544 transitions. [2023-11-21 22:15:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 544 transitions. [2023-11-21 22:15:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2023-11-21 22:15:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7215189873417722) internal successors, (544), 315 states have internal predecessors, (544), 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-21 22:15:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 544 transitions. [2023-11-21 22:15:05,553 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 544 transitions. [2023-11-21 22:15:05,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:15:05,557 INFO L428 stractBuchiCegarLoop]: Abstraction has 316 states and 544 transitions. [2023-11-21 22:15:05,557 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 22:15:05,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 544 transitions. [2023-11-21 22:15:05,559 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-21 22:15:05,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:05,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:05,564 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] [2023-11-21 22:15:05,564 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] [2023-11-21 22:15:05,565 INFO L748 eck$LassoCheckResult]: Stem: 3423#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3424#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 3475#L408 assume !(1 == ~c_req_up~0); 3412#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3554#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3573#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3524#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 3525#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3486#L439-1 assume !(0 == ~e_f~0); 3351#L444-1 assume !(0 == ~e_g~0); 3352#L449-1 assume !(0 == ~e_e~0); 3511#L454-1 assume !(0 == ~e_c~0); 3512#L459-1 assume !(0 == ~e_wl~0); 3425#L464-1 assume !(1 == ~wl_pc~0); 3426#$Ultimate##44 assume !(2 == ~wl_pc~0); 3421#L477 assume !(1 == ~c1_pc~0); 3408#L487 assume !(1 == ~c2_pc~0); 3410#L496 assume !(1 == ~wb_pc~0); 3446#L505 assume !(1 == ~e_c~0); 3447#L514-1 assume !(1 == ~e_e~0); 3472#L519-1 assume !(1 == ~e_f~0); 3478#L524-1 assume !(1 == ~e_g~0); 3479#L529-1 assume !(1 == ~e_c~0); 3345#L534-1 assume !(1 == ~e_wl~0); 3346#L676-1 assume !false; 3348#L546 [2023-11-21 22:15:05,565 INFO L750 eck$LassoCheckResult]: Loop: 3348#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 3396#L381 assume !false; 3468#L299 assume !(0 == ~wl_st~0); 3469#L303 assume !(0 == ~c1_st~0); 3571#L306 assume !(0 == ~c2_st~0); 3558#L309 assume !(0 == ~wb_st~0); 3559#L312 assume !(0 == ~r_st~0); 3574#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 3580#L552 assume !(1 == ~c_req_up~0); 3520#L552-2 start_simulation_~kernel_st~0#1 := 3; 3521#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 3401#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3353#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3354#L574-1 assume !(0 == ~e_c~0); 3373#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3374#L584-1 assume 1 == ~wl_pc~0; 3493#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3494#L597 assume !(1 == ~c1_pc~0); 3434#L607 assume !(1 == ~c2_pc~0); 3435#L616 assume !(1 == ~wb_pc~0); 3535#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 3518#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3507#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3508#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3540#L649-1 assume !(1 == ~e_c~0); 3476#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3413#L659-1 assume 0 == ~wl_st~0; 3347#L676-1 assume !false; 3348#L546 [2023-11-21 22:15:05,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1939846590, now seen corresponding path program 1 times [2023-11-21 22:15:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:05,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736232572] [2023-11-21 22:15:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,655 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-21 22:15:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:05,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736232572] [2023-11-21 22:15:05,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736232572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:05,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:05,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006260863] [2023-11-21 22:15:05,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:05,657 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:15:05,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:05,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1635242511, now seen corresponding path program 1 times [2023-11-21 22:15:05,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:05,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451510234] [2023-11-21 22:15:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:05,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,696 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-21 22:15:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451510234] [2023-11-21 22:15:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451510234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:05,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:05,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451503723] [2023-11-21 22:15:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:05,698 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:15:05,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:05,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:15:05,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:15:05,699 INFO L87 Difference]: Start difference. First operand 316 states and 544 transitions. cyclomatic complexity: 231 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-21 22:15:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:05,709 INFO L93 Difference]: Finished difference Result 316 states and 543 transitions. [2023-11-21 22:15:05,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 543 transitions. [2023-11-21 22:15:05,714 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-21 22:15:05,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 543 transitions. [2023-11-21 22:15:05,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2023-11-21 22:15:05,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2023-11-21 22:15:05,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 543 transitions. [2023-11-21 22:15:05,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:05,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 543 transitions. [2023-11-21 22:15:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 543 transitions. [2023-11-21 22:15:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2023-11-21 22:15:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7183544303797469) internal successors, (543), 315 states have internal predecessors, (543), 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-21 22:15:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 543 transitions. [2023-11-21 22:15:05,729 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 543 transitions. [2023-11-21 22:15:05,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:15:05,732 INFO L428 stractBuchiCegarLoop]: Abstraction has 316 states and 543 transitions. [2023-11-21 22:15:05,732 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 22:15:05,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 543 transitions. [2023-11-21 22:15:05,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-21 22:15:05,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:05,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:05,738 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] [2023-11-21 22:15:05,739 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] [2023-11-21 22:15:05,739 INFO L748 eck$LassoCheckResult]: Stem: 4062#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4063#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 4115#L408 assume !(1 == ~c_req_up~0); 4051#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4191#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4211#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4161#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4162#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4126#L439-1 assume !(0 == ~e_f~0); 3990#L444-1 assume !(0 == ~e_g~0); 3991#L449-1 assume !(0 == ~e_e~0); 4151#L454-1 assume !(0 == ~e_c~0); 4152#L459-1 assume !(0 == ~e_wl~0); 4064#L464-1 assume !(1 == ~wl_pc~0); 4065#$Ultimate##44 assume !(2 == ~wl_pc~0); 4060#L477 assume !(1 == ~c1_pc~0); 4041#L487 assume !(1 == ~c2_pc~0); 4043#L496 assume !(1 == ~wb_pc~0); 4085#L505 assume !(1 == ~e_c~0); 4086#L514-1 assume !(1 == ~e_e~0); 4107#L519-1 assume !(1 == ~e_f~0); 4116#L524-1 assume !(1 == ~e_g~0); 4117#L529-1 assume !(1 == ~e_c~0); 3984#L534-1 assume !(1 == ~e_wl~0); 3985#L676-1 assume !false; 3987#L546 [2023-11-21 22:15:05,740 INFO L750 eck$LassoCheckResult]: Loop: 3987#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 4035#L381 assume !false; 4108#L299 assume !(0 == ~wl_st~0); 4110#L303 assume !(0 == ~c1_st~0); 4209#L306 assume !(0 == ~c2_st~0); 4196#L309 assume !(0 == ~wb_st~0); 4197#L312 assume !(0 == ~r_st~0); 4212#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 4218#L552 assume !(1 == ~c_req_up~0); 4159#L552-2 start_simulation_~kernel_st~0#1 := 3; 4160#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 4040#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3992#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3993#L574-1 assume !(0 == ~e_c~0); 4012#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4013#L584-1 assume 1 == ~wl_pc~0; 4133#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4134#L597 assume !(1 == ~c1_pc~0); 4073#L607 assume !(1 == ~c2_pc~0); 4074#L616 assume !(1 == ~wb_pc~0); 4173#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 4157#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4147#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4148#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4178#L649-1 assume !(1 == ~e_c~0); 4118#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4052#L659-1 assume 0 == ~wl_st~0; 3986#L676-1 assume !false; 3987#L546 [2023-11-21 22:15:05,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:05,741 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2023-11-21 22:15:05,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:05,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988586006] [2023-11-21 22:15:05,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:05,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:05,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:05,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:05,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1635242511, now seen corresponding path program 2 times [2023-11-21 22:15:05,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502867962] [2023-11-21 22:15:05,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:05,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,846 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-21 22:15:05,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:05,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502867962] [2023-11-21 22:15:05,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502867962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:05,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:05,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:05,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605225091] [2023-11-21 22:15:05,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:05,848 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:15:05,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:05,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:15:05,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:15:05,849 INFO L87 Difference]: Start difference. First operand 316 states and 543 transitions. cyclomatic complexity: 230 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-21 22:15:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:05,885 INFO L93 Difference]: Finished difference Result 378 states and 658 transitions. [2023-11-21 22:15:05,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 658 transitions. [2023-11-21 22:15:05,889 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2023-11-21 22:15:05,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 363 states and 628 transitions. [2023-11-21 22:15:05,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2023-11-21 22:15:05,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2023-11-21 22:15:05,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 363 states and 628 transitions. [2023-11-21 22:15:05,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:05,895 INFO L218 hiAutomatonCegarLoop]: Abstraction has 363 states and 628 transitions. [2023-11-21 22:15:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states and 628 transitions. [2023-11-21 22:15:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2023-11-21 22:15:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 363 states have (on average 1.7300275482093663) internal successors, (628), 362 states have internal predecessors, (628), 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-21 22:15:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 628 transitions. [2023-11-21 22:15:05,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 363 states and 628 transitions. [2023-11-21 22:15:05,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:15:05,906 INFO L428 stractBuchiCegarLoop]: Abstraction has 363 states and 628 transitions. [2023-11-21 22:15:05,906 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 22:15:05,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 363 states and 628 transitions. [2023-11-21 22:15:05,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2023-11-21 22:15:05,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:05,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:05,910 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] [2023-11-21 22:15:05,910 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] [2023-11-21 22:15:05,911 INFO L748 eck$LassoCheckResult]: Stem: 4761#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4762#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 4816#L408 assume !(1 == ~c_req_up~0); 4750#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4899#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4919#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4863#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4864#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4827#L439-1 assume !(0 == ~e_f~0); 4690#L444-1 assume !(0 == ~e_g~0); 4691#L449-1 assume !(0 == ~e_e~0); 4852#L454-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4853#L459-1 assume !(0 == ~e_wl~0); 4988#L464-1 assume !(1 == ~wl_pc~0); 4986#$Ultimate##44 assume !(2 == ~wl_pc~0); 4984#L477 assume !(1 == ~c1_pc~0); 4982#L487 assume !(1 == ~c2_pc~0); 4900#L496 assume !(1 == ~wb_pc~0); 4784#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 4785#L514-1 assume !(1 == ~e_e~0); 4923#L519-1 assume !(1 == ~e_f~0); 4922#L524-1 assume !(1 == ~e_g~0); 4921#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4684#L534-1 assume !(1 == ~e_wl~0); 4685#L676-1 assume !false; 4924#L546 [2023-11-21 22:15:05,911 INFO L750 eck$LassoCheckResult]: Loop: 4924#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 4958#L381 assume !false; 4807#L299 assume !(0 == ~wl_st~0); 4809#L303 assume !(0 == ~c1_st~0); 4917#L306 assume !(0 == ~c2_st~0); 4904#L309 assume !(0 == ~wb_st~0); 4905#L312 assume !(0 == ~r_st~0); 4908#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 4821#L552 assume !(1 == ~c_req_up~0); 4822#L552-2 start_simulation_~kernel_st~0#1 := 3; 4730#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 4731#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 4692#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 4693#L574-1 assume !(0 == ~e_c~0); 4712#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4713#L584-1 assume 1 == ~wl_pc~0; 4834#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4835#L597 assume !(1 == ~c1_pc~0); 4772#L607 assume !(1 == ~c2_pc~0); 4773#L616 assume !(1 == ~wb_pc~0); 4877#L625 assume !(1 == ~e_c~0); 4859#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4848#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4849#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4882#L649-1 assume !(1 == ~e_c~0); 4883#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4968#L659-1 assume 0 == ~wl_st~0; 4963#L676-1 assume !false; 4924#L546 [2023-11-21 22:15:05,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:05,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1430068998, now seen corresponding path program 1 times [2023-11-21 22:15:05,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:05,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581992354] [2023-11-21 22:15:05,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:05,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,966 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-21 22:15:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:05,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581992354] [2023-11-21 22:15:05,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581992354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:05,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208980277] [2023-11-21 22:15:05,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:05,968 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:15:05,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash 825895885, now seen corresponding path program 1 times [2023-11-21 22:15:05,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:05,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697635556] [2023-11-21 22:15:05,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:05,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:05,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:06,223 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:15:06,223 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:15:06,223 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:15:06,223 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:15:06,224 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-21 22:15:06,224 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:06,224 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:15:06,224 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:15:06,224 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2023-11-21 22:15:06,224 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:15:06,224 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:15:06,227 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-21 22:15:06,233 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-21 22:15:06,236 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-21 22:15:06,239 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-21 22:15:06,243 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-21 22:15:06,247 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-21 22:15:06,253 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-21 22:15:06,256 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-21 22:15:06,260 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-21 22:15:06,263 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-21 22:15:06,267 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-21 22:15:06,272 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-21 22:15:06,276 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-21 22:15:06,279 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-21 22:15:06,282 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-21 22:15:06,287 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-21 22:15:06,290 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-21 22:15:06,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-21 22:15:06,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-21 22:15:06,298 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-21 22:15:06,302 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-21 22:15:06,307 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-21 22:15:06,310 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-21 22:15:06,312 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-21 22:15:06,315 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-21 22:15:06,317 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-21 22:15:06,570 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:15:06,570 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-21 22:15:06,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:06,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:06,573 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:06,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:15:06,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:06,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-21 22:15:06,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:06,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:06,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:06,627 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:06,633 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-21 22:15:06,633 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:15:06,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-21 22:15:06,656 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-21 22:15:06,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:06,680 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:15:06,680 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:15:06,680 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:15:06,680 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:15:06,680 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:15:06,680 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:06,680 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:15:06,681 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:15:06,681 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2023-11-21 22:15:06,681 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:15:06,681 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:15:06,683 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-21 22:15:06,686 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-21 22:15:06,692 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-21 22:15:06,694 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-21 22:15:06,697 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-21 22:15:06,703 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-21 22:15:06,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-21 22:15:06,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-21 22:15:06,712 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-21 22:15:06,715 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-21 22:15:06,721 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-21 22:15:06,724 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-21 22:15:06,726 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-21 22:15:06,729 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-21 22:15:06,732 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-21 22:15:06,735 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-21 22:15:06,740 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-21 22:15:06,743 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-21 22:15:06,746 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-21 22:15:06,749 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-21 22:15:06,752 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-21 22:15:06,754 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-21 22:15:06,759 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-21 22:15:06,762 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-21 22:15:06,764 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-21 22:15:06,766 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-21 22:15:07,007 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:15:07,007 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:15:07,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:07,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:07,008 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:07,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:15:07,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:15:07,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:15:07,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:15:07,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:15:07,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:15:07,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:15:07,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:15:07,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-21 22:15:07,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:15:07,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:07,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:07,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:07,068 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:07,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:15:07,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:15:07,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:15:07,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:15:07,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:15:07,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:15:07,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-21 22:15:07,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:15:07,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:15:07,101 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:15:07,110 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-21 22:15:07,110 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-21 22:15:07,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:15:07,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:07,112 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:07,115 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:15:07,115 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-21 22:15:07,115 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:15:07,115 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] [2023-11-21 22:15:07,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-21 22:15:07,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:07,140 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-21 22:15:07,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:07,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:15:07,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:15:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:07,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:15:07,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:15:07,333 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-21 22:15:07,334 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-21 22:15:07,335 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 363 states and 628 transitions. cyclomatic complexity: 268 Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:15:07,379 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 363 states and 628 transitions. cyclomatic complexity: 268. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 980 states and 1690 transitions. Complement of second has 5 states. [2023-11-21 22:15:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-21 22:15:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:15:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2023-11-21 22:15:07,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 25 letters. Loop has 28 letters. [2023-11-21 22:15:07,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:15:07,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 53 letters. Loop has 28 letters. [2023-11-21 22:15:07,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:15:07,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 25 letters. Loop has 56 letters. [2023-11-21 22:15:07,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:15:07,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 980 states and 1690 transitions. [2023-11-21 22:15:07,393 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 388 [2023-11-21 22:15:07,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 980 states to 965 states and 1669 transitions. [2023-11-21 22:15:07,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 448 [2023-11-21 22:15:07,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 454 [2023-11-21 22:15:07,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 965 states and 1669 transitions. [2023-11-21 22:15:07,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:07,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 965 states and 1669 transitions. [2023-11-21 22:15:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states and 1669 transitions. [2023-11-21 22:15:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 944. [2023-11-21 22:15:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 944 states have (on average 1.7394067796610169) internal successors, (1642), 943 states have internal predecessors, (1642), 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-21 22:15:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1642 transitions. [2023-11-21 22:15:07,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 944 states and 1642 transitions. [2023-11-21 22:15:07,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:07,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:07,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:07,430 INFO L87 Difference]: Start difference. First operand 944 states and 1642 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-21 22:15:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:07,537 INFO L93 Difference]: Finished difference Result 1315 states and 2246 transitions. [2023-11-21 22:15:07,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1315 states and 2246 transitions. [2023-11-21 22:15:07,549 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 484 [2023-11-21 22:15:07,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1315 states to 1315 states and 2246 transitions. [2023-11-21 22:15:07,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 572 [2023-11-21 22:15:07,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 572 [2023-11-21 22:15:07,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1315 states and 2246 transitions. [2023-11-21 22:15:07,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:07,564 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1315 states and 2246 transitions. [2023-11-21 22:15:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states and 2246 transitions. [2023-11-21 22:15:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1125. [2023-11-21 22:15:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1125 states have (on average 1.7182222222222223) internal successors, (1933), 1124 states have internal predecessors, (1933), 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-21 22:15:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1933 transitions. [2023-11-21 22:15:07,596 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1125 states and 1933 transitions. [2023-11-21 22:15:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:15:07,597 INFO L428 stractBuchiCegarLoop]: Abstraction has 1125 states and 1933 transitions. [2023-11-21 22:15:07,597 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 22:15:07,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1125 states and 1933 transitions. [2023-11-21 22:15:07,607 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 400 [2023-11-21 22:15:07,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:07,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:07,609 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] [2023-11-21 22:15:07,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:07,609 INFO L748 eck$LassoCheckResult]: Stem: 8545#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 8546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 8600#L408 assume !(1 == ~c_req_up~0); 8712#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 8729#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 8730#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 8738#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 8737#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8611#L439-1 assume !(0 == ~e_f~0); 8474#L444-1 assume !(0 == ~e_g~0); 8475#L449-1 assume !(0 == ~e_e~0); 8636#L454-1 assume !(0 == ~e_c~0); 8637#L459-1 assume !(0 == ~e_wl~0); 8547#L464-1 assume !(1 == ~wl_pc~0); 8548#$Ultimate##44 assume !(2 == ~wl_pc~0); 8542#L477 assume !(1 == ~c1_pc~0); 8544#L487 assume !(1 == ~c2_pc~0); 9087#L496 assume !(1 == ~wb_pc~0); 9085#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 8569#L514-1 assume !(1 == ~e_e~0); 8597#L519-1 assume !(1 == ~e_f~0); 8603#L524-1 assume !(1 == ~e_g~0); 8604#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 8468#L534-1 assume !(1 == ~e_wl~0); 8469#L676-1 assume !false; 8808#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 8519#L381 [2023-11-21 22:15:07,609 INFO L750 eck$LassoCheckResult]: Loop: 8519#L381 assume !false; 8592#L299 assume 0 == ~wl_st~0; 8550#L312-1 assume !(0 == ~wl_st~0); 8551#L321 assume !(0 == ~c1_st~0); 8512#L336 assume !(0 == ~c2_st~0); 8572#L351 assume !(0 == ~wb_st~0); 8481#L366 assume !(0 == ~r_st~0); 8519#L381 [2023-11-21 22:15:07,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:07,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1632637821, now seen corresponding path program 1 times [2023-11-21 22:15:07,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:07,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203477624] [2023-11-21 22:15:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:07,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:07,665 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-21 22:15:07,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203477624] [2023-11-21 22:15:07,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203477624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:07,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:07,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:07,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419283964] [2023-11-21 22:15:07,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:07,671 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:15:07,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash 121813293, now seen corresponding path program 1 times [2023-11-21 22:15:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:07,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350756343] [2023-11-21 22:15:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:07,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:07,685 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-21 22:15:07,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:07,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350756343] [2023-11-21 22:15:07,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350756343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:07,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:07,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:07,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44304224] [2023-11-21 22:15:07,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:07,687 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:15:07,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:07,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:15:07,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:15:07,688 INFO L87 Difference]: Start difference. First operand 1125 states and 1933 transitions. cyclomatic complexity: 819 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-21 22:15:07,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:07,737 INFO L93 Difference]: Finished difference Result 1795 states and 3046 transitions. [2023-11-21 22:15:07,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1795 states and 3046 transitions. [2023-11-21 22:15:07,755 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 646 [2023-11-21 22:15:07,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1795 states to 1795 states and 3046 transitions. [2023-11-21 22:15:07,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 726 [2023-11-21 22:15:07,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 726 [2023-11-21 22:15:07,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1795 states and 3046 transitions. [2023-11-21 22:15:07,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:07,774 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2023-11-21 22:15:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states and 3046 transitions. [2023-11-21 22:15:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2023-11-21 22:15:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1795 states have (on average 1.6969359331476324) internal successors, (3046), 1794 states have internal predecessors, (3046), 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-21 22:15:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3046 transitions. [2023-11-21 22:15:07,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2023-11-21 22:15:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:15:07,832 INFO L428 stractBuchiCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2023-11-21 22:15:07,832 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-21 22:15:07,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1795 states and 3046 transitions. [2023-11-21 22:15:07,846 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 646 [2023-11-21 22:15:07,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:07,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:07,848 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] [2023-11-21 22:15:07,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:07,848 INFO L748 eck$LassoCheckResult]: Stem: 11472#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 11473#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 11525#L408 assume !(1 == ~c_req_up~0); 11461#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 11691#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 11690#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 11689#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 11688#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 11538#L439-1 assume !(0 == ~e_f~0); 11401#L444-1 assume !(0 == ~e_g~0); 11402#L449-1 assume !(0 == ~e_e~0); 11565#L454-1 assume !(0 == ~e_c~0); 11566#L459-1 assume !(0 == ~e_wl~0); 11474#L464-1 assume !(1 == ~wl_pc~0); 11475#$Ultimate##44 assume !(2 == ~wl_pc~0); 11470#L477 assume !(1 == ~c1_pc~0); 11452#L487 assume !(1 == ~c2_pc~0); 11454#L496 assume !(1 == ~wb_pc~0); 12093#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 11494#L514-1 assume !(1 == ~e_e~0); 11693#L519-1 assume !(1 == ~e_f~0); 11692#L524-1 assume !(1 == ~e_g~0); 11680#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 11395#L534-1 assume !(1 == ~e_wl~0); 11396#L676-1 assume !false; 12065#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 12417#L381 [2023-11-21 22:15:07,848 INFO L750 eck$LassoCheckResult]: Loop: 12417#L381 assume !false; 12907#L299 assume 0 == ~wl_st~0; 12905#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 12902#L325 assume !(0 != eval_~tmp~0#1); 11588#L321 assume !(0 == ~c1_st~0); 11439#L336 assume !(0 == ~c2_st~0); 11497#L351 assume !(0 == ~wb_st~0); 11408#L366 assume !(0 == ~r_st~0); 12417#L381 [2023-11-21 22:15:07,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:07,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1632637821, now seen corresponding path program 2 times [2023-11-21 22:15:07,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:07,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467938841] [2023-11-21 22:15:07,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:07,889 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-21 22:15:07,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:07,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467938841] [2023-11-21 22:15:07,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467938841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:07,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:07,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413775670] [2023-11-21 22:15:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:07,891 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:15:07,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 1 times [2023-11-21 22:15:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:07,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363207803] [2023-11-21 22:15:07,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:07,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:07,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:15:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:15:07,934 INFO L87 Difference]: Start difference. First operand 1795 states and 3046 transitions. cyclomatic complexity: 1262 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-21 22:15:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:07,988 INFO L93 Difference]: Finished difference Result 3100 states and 5202 transitions. [2023-11-21 22:15:07,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3100 states and 5202 transitions. [2023-11-21 22:15:08,063 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1226 [2023-11-21 22:15:08,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-11-21 22:15:08,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3100 states to 2525 states and 4241 transitions. [2023-11-21 22:15:08,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1311 [2023-11-21 22:15:08,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1343 [2023-11-21 22:15:08,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2525 states and 4241 transitions. [2023-11-21 22:15:08,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:08,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2525 states and 4241 transitions. [2023-11-21 22:15:08,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states and 4241 transitions. [2023-11-21 22:15:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 1638. [2023-11-21 22:15:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1638 states have (on average 1.6904761904761905) internal successors, (2769), 1637 states have internal predecessors, (2769), 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-21 22:15:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2769 transitions. [2023-11-21 22:15:08,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1638 states and 2769 transitions. [2023-11-21 22:15:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:15:08,147 INFO L428 stractBuchiCegarLoop]: Abstraction has 1638 states and 2769 transitions. [2023-11-21 22:15:08,148 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-21 22:15:08,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1638 states and 2769 transitions. [2023-11-21 22:15:08,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 646 [2023-11-21 22:15:08,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:08,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:08,160 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] [2023-11-21 22:15:08,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:08,162 INFO L748 eck$LassoCheckResult]: Stem: 16373#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 16374#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 16424#L408 assume !(1 == ~c_req_up~0); 16515#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 16516#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 16557#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16558#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16549#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16436#L439-1 assume !(0 == ~e_f~0); 16302#L444-1 assume !(0 == ~e_g~0); 16303#L449-1 assume !(0 == ~e_e~0); 16463#L454-1 assume !(0 == ~e_c~0); 16464#L459-1 assume !(0 == ~e_wl~0); 16544#L464-1 assume !(1 == ~wl_pc~0); 16596#$Ultimate##44 assume !(2 == ~wl_pc~0); 16592#L477 assume !(1 == ~c1_pc~0); 16590#L487 assume !(1 == ~c2_pc~0); 16587#L496 assume !(1 == ~wb_pc~0); 16394#L505 assume !(1 == ~e_c~0); 16395#L514-1 assume !(1 == ~e_e~0); 16417#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 16425#L524-1 assume !(1 == ~e_g~0); 16426#L529-1 assume !(1 == ~e_c~0); 16296#L534-1 assume !(1 == ~e_wl~0); 16297#L676-1 assume !false; 16733#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 16347#L381 [2023-11-21 22:15:08,162 INFO L750 eck$LassoCheckResult]: Loop: 16347#L381 assume !false; 17800#L299 assume 0 == ~wl_st~0; 17757#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 17794#L325 assume !(0 != eval_~tmp~0#1); 16487#L321 assume !(0 == ~c1_st~0); 16340#L336 assume !(0 == ~c2_st~0); 16398#L351 assume !(0 == ~wb_st~0); 16309#L366 assume !(0 == ~r_st~0); 16347#L381 [2023-11-21 22:15:08,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 766092475, now seen corresponding path program 1 times [2023-11-21 22:15:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028393720] [2023-11-21 22:15:08,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:08,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:08,224 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-21 22:15:08,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:08,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028393720] [2023-11-21 22:15:08,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028393720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:08,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:08,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:08,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267769851] [2023-11-21 22:15:08,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:08,227 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:15:08,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:08,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 2 times [2023-11-21 22:15:08,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:08,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735901227] [2023-11-21 22:15:08,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:08,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:08,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:08,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:08,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:08,274 INFO L87 Difference]: Start difference. First operand 1638 states and 2769 transitions. cyclomatic complexity: 1138 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-21 22:15:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:08,401 INFO L93 Difference]: Finished difference Result 2129 states and 3576 transitions. [2023-11-21 22:15:08,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2129 states and 3576 transitions. [2023-11-21 22:15:08,419 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 870 [2023-11-21 22:15:08,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2129 states to 2129 states and 3576 transitions. [2023-11-21 22:15:08,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1079 [2023-11-21 22:15:08,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1079 [2023-11-21 22:15:08,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2129 states and 3576 transitions. [2023-11-21 22:15:08,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:08,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2129 states and 3576 transitions. [2023-11-21 22:15:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states and 3576 transitions. [2023-11-21 22:15:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1941. [2023-11-21 22:15:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1941 states have (on average 1.6867594023699124) internal successors, (3274), 1940 states have internal predecessors, (3274), 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-21 22:15:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 3274 transitions. [2023-11-21 22:15:08,491 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1941 states and 3274 transitions. [2023-11-21 22:15:08,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:15:08,492 INFO L428 stractBuchiCegarLoop]: Abstraction has 1941 states and 3274 transitions. [2023-11-21 22:15:08,492 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-21 22:15:08,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1941 states and 3274 transitions. [2023-11-21 22:15:08,502 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 728 [2023-11-21 22:15:08,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:08,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:08,503 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] [2023-11-21 22:15:08,503 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:08,503 INFO L748 eck$LassoCheckResult]: Stem: 20150#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 20151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 20205#L408 assume !(1 == ~c_req_up~0); 20139#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 20366#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 20367#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 20259#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 20260#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 20217#L439-1 assume !(0 == ~e_f~0); 20079#L444-1 assume !(0 == ~e_g~0); 20080#L449-1 assume !(0 == ~e_e~0); 20243#L454-1 assume !(0 == ~e_c~0); 20244#L459-1 assume !(0 == ~e_wl~0); 20152#L464-1 assume !(1 == ~wl_pc~0); 20153#$Ultimate##44 assume !(2 == ~wl_pc~0); 20446#L477 assume !(1 == ~c1_pc~0); 20405#L487 assume !(1 == ~c2_pc~0); 20401#L496 assume !(1 == ~wb_pc~0); 20398#L505 assume !(1 == ~e_c~0); 20396#L514-1 assume !(1 == ~e_e~0); 20393#L519-1 assume !(1 == ~e_f~0); 20391#L524-1 assume !(1 == ~e_g~0); 20373#L529-1 assume !(1 == ~e_c~0); 20374#L534-1 assume !(1 == ~e_wl~0); 21328#L676-1 assume !false; 21011#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 20124#L381 [2023-11-21 22:15:08,503 INFO L750 eck$LassoCheckResult]: Loop: 20124#L381 assume !false; 20198#L299 assume 0 == ~wl_st~0; 20155#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 20156#L325 assume !(0 != eval_~tmp~0#1); 20271#L321 assume !(0 == ~c1_st~0); 20117#L336 assume !(0 == ~c2_st~0); 20175#L351 assume !(0 == ~wb_st~0); 20086#L366 assume !(0 == ~r_st~0); 20124#L381 [2023-11-21 22:15:08,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2023-11-21 22:15:08,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:08,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013442627] [2023-11-21 22:15:08,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:08,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:08,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:08,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:08,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:08,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 3 times [2023-11-21 22:15:08,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:08,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126769896] [2023-11-21 22:15:08,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:08,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:08,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:08,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:08,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:08,533 INFO L85 PathProgramCache]: Analyzing trace with hash 365677936, now seen corresponding path program 1 times [2023-11-21 22:15:08,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:08,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446270725] [2023-11-21 22:15:08,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:08,563 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-21 22:15:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:08,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446270725] [2023-11-21 22:15:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446270725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:08,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:08,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:08,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437915292] [2023-11-21 22:15:08,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:08,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:08,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:15:08,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:15:08,597 INFO L87 Difference]: Start difference. First operand 1941 states and 3274 transitions. cyclomatic complexity: 1340 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:15:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:08,661 INFO L93 Difference]: Finished difference Result 3072 states and 5123 transitions. [2023-11-21 22:15:08,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3072 states and 5123 transitions. [2023-11-21 22:15:08,682 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1134 [2023-11-21 22:15:08,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3072 states to 3072 states and 5123 transitions. [2023-11-21 22:15:08,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1394 [2023-11-21 22:15:08,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1394 [2023-11-21 22:15:08,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3072 states and 5123 transitions. [2023-11-21 22:15:08,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:08,713 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2023-11-21 22:15:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states and 5123 transitions. [2023-11-21 22:15:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2023-11-21 22:15:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3072 states have (on average 1.6676432291666667) internal successors, (5123), 3071 states have internal predecessors, (5123), 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-21 22:15:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 5123 transitions. [2023-11-21 22:15:08,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2023-11-21 22:15:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:15:08,788 INFO L428 stractBuchiCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2023-11-21 22:15:08,789 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-21 22:15:08,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3072 states and 5123 transitions. [2023-11-21 22:15:08,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1134 [2023-11-21 22:15:08,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:08,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:08,869 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] [2023-11-21 22:15:08,870 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:08,870 INFO L748 eck$LassoCheckResult]: Stem: 25174#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 25175#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 25227#L408 assume !(1 == ~c_req_up~0); 25161#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 25376#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 25377#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 25282#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 25283#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 25239#L439-1 assume !(0 == ~e_f~0); 25240#L444-1 assume !(0 == ~e_g~0); 25447#L449-1 assume !(0 == ~e_e~0); 25440#L454-1 assume !(0 == ~e_c~0); 25439#L459-1 assume !(0 == ~e_wl~0); 25438#L464-1 assume !(1 == ~wl_pc~0); 25428#$Ultimate##44 assume !(2 == ~wl_pc~0); 25420#L477 assume !(1 == ~c1_pc~0); 25412#L487 assume !(1 == ~c2_pc~0); 25405#L496 assume !(1 == ~wb_pc~0); 25401#L505 assume !(1 == ~e_c~0); 25398#L514-1 assume !(1 == ~e_e~0); 25394#L519-1 assume !(1 == ~e_f~0); 25392#L524-1 assume !(1 == ~e_g~0); 25382#L529-1 assume !(1 == ~e_c~0); 25383#L534-1 assume !(1 == ~e_wl~0); 27458#L676-1 assume !false; 27459#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 25696#L381 [2023-11-21 22:15:08,870 INFO L750 eck$LassoCheckResult]: Loop: 25696#L381 assume !false; 27253#L299 assume 0 == ~wl_st~0; 27225#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 27222#L325 assume !(0 != eval_~tmp~0#1); 27221#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 27204#L340 assume !(0 != eval_~tmp___0~0#1); 27220#L336 assume !(0 == ~c2_st~0); 27320#L351 assume !(0 == ~wb_st~0); 27295#L366 assume !(0 == ~r_st~0); 25696#L381 [2023-11-21 22:15:08,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:08,871 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2023-11-21 22:15:08,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:08,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296964093] [2023-11-21 22:15:08,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:08,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:08,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:08,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:08,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:08,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1117173442, now seen corresponding path program 1 times [2023-11-21 22:15:08,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:08,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840760577] [2023-11-21 22:15:08,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:08,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:08,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:08,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:08,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1600612406, now seen corresponding path program 1 times [2023-11-21 22:15:08,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:08,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717256572] [2023-11-21 22:15:08,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:08,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:08,945 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-21 22:15:08,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:08,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717256572] [2023-11-21 22:15:08,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717256572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:08,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:08,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540632935] [2023-11-21 22:15:08,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:08,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:08,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:15:08,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:15:08,993 INFO L87 Difference]: Start difference. First operand 3072 states and 5123 transitions. cyclomatic complexity: 2058 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:15:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:09,080 INFO L93 Difference]: Finished difference Result 4987 states and 8221 transitions. [2023-11-21 22:15:09,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4987 states and 8221 transitions. [2023-11-21 22:15:09,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2023-11-21 22:15:09,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4987 states to 4987 states and 8221 transitions. [2023-11-21 22:15:09,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2289 [2023-11-21 22:15:09,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2289 [2023-11-21 22:15:09,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4987 states and 8221 transitions. [2023-11-21 22:15:09,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:09,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2023-11-21 22:15:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states and 8221 transitions. [2023-11-21 22:15:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4987. [2023-11-21 22:15:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4987 states have (on average 1.648486063765791) internal successors, (8221), 4986 states have internal predecessors, (8221), 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-21 22:15:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 8221 transitions. [2023-11-21 22:15:09,307 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2023-11-21 22:15:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:15:09,313 INFO L428 stractBuchiCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2023-11-21 22:15:09,313 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-21 22:15:09,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4987 states and 8221 transitions. [2023-11-21 22:15:09,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2023-11-21 22:15:09,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:09,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:09,336 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] [2023-11-21 22:15:09,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:09,336 INFO L748 eck$LassoCheckResult]: Stem: 33239#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 33240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 33294#L408 assume !(1 == ~c_req_up~0); 33226#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 33436#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 33434#L424-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 33435#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 36847#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 36846#L439-1 assume !(0 == ~e_f~0); 36845#L444-1 assume !(0 == ~e_g~0); 36844#L449-1 assume !(0 == ~e_e~0); 36842#L454-1 assume !(0 == ~e_c~0); 36841#L459-1 assume !(0 == ~e_wl~0); 36840#L464-1 assume !(1 == ~wl_pc~0); 36838#$Ultimate##44 assume !(2 == ~wl_pc~0); 36836#L477 assume !(1 == ~c1_pc~0); 36829#L487 assume !(1 == ~c2_pc~0); 36826#L496 assume !(1 == ~wb_pc~0); 36823#L505 assume !(1 == ~e_c~0); 36822#L514-1 assume !(1 == ~e_e~0); 36819#L519-1 assume !(1 == ~e_f~0); 36814#L524-1 assume !(1 == ~e_g~0); 36813#L529-1 assume !(1 == ~e_c~0); 36812#L534-1 assume !(1 == ~e_wl~0); 36811#L676-1 assume !false; 36768#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 33715#L381 [2023-11-21 22:15:09,337 INFO L750 eck$LassoCheckResult]: Loop: 33715#L381 assume !false; 37859#L299 assume 0 == ~wl_st~0; 35885#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 35883#L325 assume !(0 != eval_~tmp~0#1); 35884#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 37085#L340 assume !(0 != eval_~tmp___0~0#1); 37164#L336 assume !(0 == ~c2_st~0); 37879#L351 assume !(0 == ~wb_st~0); 37863#L366 assume !(0 == ~r_st~0); 33715#L381 [2023-11-21 22:15:09,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2023-11-21 22:15:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:09,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795756805] [2023-11-21 22:15:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:09,381 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-21 22:15:09,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795756805] [2023-11-21 22:15:09,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795756805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:09,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:09,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:09,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317314463] [2023-11-21 22:15:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:09,383 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:15:09,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1117173442, now seen corresponding path program 2 times [2023-11-21 22:15:09,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:09,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786058768] [2023-11-21 22:15:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:09,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:09,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:09,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:09,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:09,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:15:09,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:15:09,441 INFO L87 Difference]: Start difference. First operand 4987 states and 8221 transitions. cyclomatic complexity: 3241 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-21 22:15:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:09,480 INFO L93 Difference]: Finished difference Result 4887 states and 8039 transitions. [2023-11-21 22:15:09,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4887 states and 8039 transitions. [2023-11-21 22:15:09,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2023-11-21 22:15:09,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4887 states to 4887 states and 8039 transitions. [2023-11-21 22:15:09,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2190 [2023-11-21 22:15:09,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2190 [2023-11-21 22:15:09,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4887 states and 8039 transitions. [2023-11-21 22:15:09,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:09,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2023-11-21 22:15:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states and 8039 transitions. [2023-11-21 22:15:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4887. [2023-11-21 22:15:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4887 states have (on average 1.644976468180888) internal successors, (8039), 4886 states have internal predecessors, (8039), 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-21 22:15:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 8039 transitions. [2023-11-21 22:15:09,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2023-11-21 22:15:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:15:09,709 INFO L428 stractBuchiCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2023-11-21 22:15:09,709 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-21 22:15:09,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4887 states and 8039 transitions. [2023-11-21 22:15:09,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2023-11-21 22:15:09,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:09,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:09,732 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] [2023-11-21 22:15:09,732 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:09,732 INFO L748 eck$LassoCheckResult]: Stem: 43120#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 43121#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 43175#L408 assume !(1 == ~c_req_up~0); 43108#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 43332#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 43333#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 43235#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 43236#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 43187#L439-1 assume !(0 == ~e_f~0); 43047#L444-1 assume !(0 == ~e_g~0); 43048#L449-1 assume !(0 == ~e_e~0); 43216#L454-1 assume !(0 == ~e_c~0); 43217#L459-1 assume !(0 == ~e_wl~0); 43122#L464-1 assume !(1 == ~wl_pc~0); 43123#$Ultimate##44 assume !(2 == ~wl_pc~0); 43118#L477 assume !(1 == ~c1_pc~0); 43104#L487 assume !(1 == ~c2_pc~0); 43106#L496 assume !(1 == ~wb_pc~0); 43141#L505 assume !(1 == ~e_c~0); 43142#L514-1 assume !(1 == ~e_e~0); 43385#L519-1 assume !(1 == ~e_f~0); 43384#L524-1 assume !(1 == ~e_g~0); 43343#L529-1 assume !(1 == ~e_c~0); 43344#L534-1 assume !(1 == ~e_wl~0); 44771#L676-1 assume !false; 44038#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 44039#L381 [2023-11-21 22:15:09,732 INFO L750 eck$LassoCheckResult]: Loop: 44039#L381 assume !false; 43165#L299 assume 0 == ~wl_st~0; 43166#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 45980#L325 assume !(0 != eval_~tmp~0#1); 43242#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 43243#L340 assume !(0 != eval_~tmp___0~0#1); 43301#L336 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 47568#L355 assume !(0 != eval_~tmp___1~0#1); 47628#L351 assume !(0 == ~wb_st~0); 47692#L366 assume !(0 == ~r_st~0); 44039#L381 [2023-11-21 22:15:09,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:09,733 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2023-11-21 22:15:09,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:09,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341465337] [2023-11-21 22:15:09,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:09,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:09,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:09,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:09,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash 270987588, now seen corresponding path program 1 times [2023-11-21 22:15:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:09,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375255431] [2023-11-21 22:15:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:09,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:09,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:09,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1918972220, now seen corresponding path program 1 times [2023-11-21 22:15:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:09,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058158717] [2023-11-21 22:15:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:09,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:09,831 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-21 22:15:09,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:09,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058158717] [2023-11-21 22:15:09,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058158717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:09,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:09,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:09,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095012380] [2023-11-21 22:15:09,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:09,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:09,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:15:09,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:15:09,941 INFO L87 Difference]: Start difference. First operand 4887 states and 8039 transitions. cyclomatic complexity: 3159 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 22:15:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:10,008 INFO L93 Difference]: Finished difference Result 8309 states and 13515 transitions. [2023-11-21 22:15:10,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8309 states and 13515 transitions. [2023-11-21 22:15:10,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3066 [2023-11-21 22:15:10,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8309 states to 8309 states and 13515 transitions. [2023-11-21 22:15:10,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3674 [2023-11-21 22:15:10,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3674 [2023-11-21 22:15:10,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8309 states and 13515 transitions. [2023-11-21 22:15:10,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:15:10,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2023-11-21 22:15:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8309 states and 13515 transitions. [2023-11-21 22:15:10,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8309 to 8309. [2023-11-21 22:15:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8309 states, 8309 states have (on average 1.6265495246118666) internal successors, (13515), 8308 states have internal predecessors, (13515), 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-21 22:15:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8309 states to 8309 states and 13515 transitions. [2023-11-21 22:15:10,309 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2023-11-21 22:15:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:15:10,311 INFO L428 stractBuchiCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2023-11-21 22:15:10,311 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-21 22:15:10,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8309 states and 13515 transitions. [2023-11-21 22:15:10,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3066 [2023-11-21 22:15:10,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:15:10,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:15:10,347 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] [2023-11-21 22:15:10,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:10,348 INFO L748 eck$LassoCheckResult]: Stem: 56322#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 56323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 56379#L408 assume !(1 == ~c_req_up~0); 56313#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 56548#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 56549#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 56440#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 56441#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 56391#L439-1 assume !(0 == ~e_f~0); 56251#L444-1 assume !(0 == ~e_g~0); 56252#L449-1 assume !(0 == ~e_e~0); 56421#L454-1 assume !(0 == ~e_c~0); 56422#L459-1 assume !(0 == ~e_wl~0); 56324#L464-1 assume !(1 == ~wl_pc~0); 56325#$Ultimate##44 assume !(2 == ~wl_pc~0); 56320#L477 assume !(1 == ~c1_pc~0); 56309#L487 assume !(1 == ~c2_pc~0); 56311#L496 assume !(1 == ~wb_pc~0); 56343#L505 assume !(1 == ~e_c~0); 56344#L514-1 assume !(1 == ~e_e~0); 56603#L519-1 assume !(1 == ~e_f~0); 56602#L524-1 assume !(1 == ~e_g~0); 56560#L529-1 assume !(1 == ~e_c~0); 56245#L534-1 assume !(1 == ~e_wl~0); 56246#L676-1 assume !false; 61932#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 58760#L381 [2023-11-21 22:15:10,348 INFO L750 eck$LassoCheckResult]: Loop: 58760#L381 assume !false; 64390#L299 assume 0 == ~wl_st~0; 63024#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 63021#L325 assume !(0 != eval_~tmp~0#1); 63022#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 63721#L340 assume !(0 != eval_~tmp___0~0#1); 63717#L336 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 63681#L355 assume !(0 != eval_~tmp___1~0#1); 63710#L351 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 63807#L370 assume !(0 != eval_~tmp___2~0#1); 63922#L366 assume !(0 == ~r_st~0); 58760#L381 [2023-11-21 22:15:10,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2023-11-21 22:15:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:10,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901574302] [2023-11-21 22:15:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:10,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:10,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:10,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:10,372 INFO L85 PathProgramCache]: Analyzing trace with hash -189354762, now seen corresponding path program 1 times [2023-11-21 22:15:10,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:10,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120905626] [2023-11-21 22:15:10,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:10,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:10,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:10,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:10,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:10,379 INFO L85 PathProgramCache]: Analyzing trace with hash -641438722, now seen corresponding path program 1 times [2023-11-21 22:15:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:10,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890052599] [2023-11-21 22:15:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:10,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:10,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:11,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:12,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.11 10:15:12 BoogieIcfgContainer [2023-11-21 22:15:12,020 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-21 22:15:12,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:15:12,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:15:12,021 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:15:12,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:15:00" (3/4) ... [2023-11-21 22:15:12,024 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-21 22:15:12,119 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 22:15:12,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:15:12,120 INFO L158 Benchmark]: Toolchain (without parser) took 13276.35ms. Allocated memory was 169.9MB in the beginning and 272.6MB in the end (delta: 102.8MB). Free memory was 142.3MB in the beginning and 77.6MB in the end (delta: 64.7MB). Peak memory consumption was 168.1MB. Max. memory is 16.1GB. [2023-11-21 22:15:12,121 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 125.8MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:15:12,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.35ms. Allocated memory is still 169.9MB. Free memory was 142.3MB in the beginning and 127.3MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-21 22:15:12,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.03ms. Allocated memory is still 169.9MB. Free memory was 127.3MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:15:12,122 INFO L158 Benchmark]: Boogie Preprocessor took 105.91ms. Allocated memory is still 169.9MB. Free memory was 124.7MB in the beginning and 122.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:15:12,123 INFO L158 Benchmark]: RCFGBuilder took 769.64ms. Allocated memory is still 169.9MB. Free memory was 122.2MB in the beginning and 98.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-21 22:15:12,124 INFO L158 Benchmark]: BuchiAutomizer took 11883.00ms. Allocated memory was 169.9MB in the beginning and 272.6MB in the end (delta: 102.8MB). Free memory was 98.8MB in the beginning and 83.9MB in the end (delta: 14.9MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. [2023-11-21 22:15:12,124 INFO L158 Benchmark]: Witness Printer took 98.74ms. Allocated memory is still 272.6MB. Free memory was 83.9MB in the beginning and 77.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-21 22:15:12,127 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 125.8MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.35ms. Allocated memory is still 169.9MB. Free memory was 142.3MB in the beginning and 127.3MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.03ms. Allocated memory is still 169.9MB. Free memory was 127.3MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.91ms. Allocated memory is still 169.9MB. Free memory was 124.7MB in the beginning and 122.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 769.64ms. Allocated memory is still 169.9MB. Free memory was 122.2MB in the beginning and 98.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 11883.00ms. Allocated memory was 169.9MB in the beginning and 272.6MB in the end (delta: 102.8MB). Free memory was 98.8MB in the beginning and 83.9MB in the end (delta: 14.9MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. * Witness Printer took 98.74ms. Allocated memory is still 272.6MB. Free memory was 83.9MB in the beginning and 77.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (13 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function ((-1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function ((-1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function ((-1 * e_f) + 1) and consists of 3 locations. 13 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 8309 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 7.9s. Construction of modules took 0.3s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 1671 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3538 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3535 mSDsluCounter, 6482 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2390 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 4092 mSDtfsCounter, 280 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN3 SILU0 SILI3 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital79 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf147 smp91 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 298]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L408] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L444] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L449] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L454] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L459] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L464] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L469] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L487] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L496] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L505] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L514] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L519] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L524] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L529] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L534] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L539] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L545] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 298]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L408] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L444] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L449] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L454] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L459] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L464] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L469] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L487] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L496] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L505] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L514] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L519] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L524] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L529] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L534] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L539] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L545] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-21 22:15:12,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20119b5-49c0-4654-bb2a-37f427d7ce7c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)