./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd --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 c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:10:30,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:10:30,829 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 14:10:30,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:10:30,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:10:30,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:10:30,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:10:30,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:10:30,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:10:30,871 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:10:30,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:10:30,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:10:30,872 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:10:30,872 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 14:10:30,872 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 14:10:30,872 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 14:10:30,873 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 14:10:30,873 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 14:10:30,873 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 14:10:30,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:10:30,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 14:10:30,874 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:10:30,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:10:30,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:10:30,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:10:30,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 14:10:30,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 14:10:30,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 14:10:30,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:10:30,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:10:30,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:10:30,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:10:30,876 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 14:10:30,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:10:30,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:10:30,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:10:30,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:10:30,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:10:30,877 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 14:10:30,877 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd 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 -> c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a [2024-11-13 14:10:31,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:10:31,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:10:31,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:10:31,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:10:31,335 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:10:31,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/systemc/toy1.cil.c Unable to find full path for "g++" [2024-11-13 14:10:33,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:10:34,223 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:10:34,224 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/sv-benchmarks/c/systemc/toy1.cil.c [2024-11-13 14:10:34,241 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/data/f8cc02107/9e6bf7a1e84a4a56a901d7464fae462e/FLAGe2108333e [2024-11-13 14:10:34,259 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/data/f8cc02107/9e6bf7a1e84a4a56a901d7464fae462e [2024-11-13 14:10:34,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:10:34,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:10:34,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:10:34,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:10:34,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:10:34,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b4448e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34, skipping insertion in model container [2024-11-13 14:10:34,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:10:34,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:10:34,643 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:10:34,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:10:34,731 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:10:34,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34 WrapperNode [2024-11-13 14:10:34,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:10:34,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:10:34,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:10:34,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:10:34,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,790 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 363 [2024-11-13 14:10:34,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:10:34,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:10:34,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:10:34,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:10:34,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,826 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:10:34,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:10:34,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:10:34,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:10:34,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:10:34,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (1/1) ... [2024-11-13 14:10:34,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:34,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:34,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:34,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 14:10:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:10:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:10:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:10:34,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:10:35,075 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:10:35,078 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:10:35,881 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-13 14:10:35,882 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:10:35,899 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:10:35,899 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-13 14:10:35,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:10:35 BoogieIcfgContainer [2024-11-13 14:10:35,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:10:35,901 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 14:10:35,901 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 14:10:35,908 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 14:10:35,909 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 14:10:35,909 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 02:10:34" (1/3) ... [2024-11-13 14:10:35,910 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2751b1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 02:10:35, skipping insertion in model container [2024-11-13 14:10:35,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 14:10:35,911 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:10:34" (2/3) ... [2024-11-13 14:10:35,911 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2751b1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 02:10:35, skipping insertion in model container [2024-11-13 14:10:35,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 14:10:35,911 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:10:35" (3/3) ... [2024-11-13 14:10:35,913 INFO L333 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2024-11-13 14:10:35,983 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 14:10:35,983 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 14:10:35,984 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 14:10:35,984 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 14:10:35,984 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 14:10:35,984 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 14:10:35,984 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 14:10:35,985 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 14:10:35,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 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) [2024-11-13 14:10:36,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2024-11-13 14:10:36,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:36,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:36,044 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] [2024-11-13 14:10:36,044 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] [2024-11-13 14:10:36,045 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 14:10:36,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 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) [2024-11-13 14:10:36,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2024-11-13 14:10:36,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:36,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:36,065 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] [2024-11-13 14:10:36,065 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] [2024-11-13 14:10:36,076 INFO L745 eck$LassoCheckResult]: Stem: 28#$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(11, 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; 46#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; 19#L416true assume !(1 == ~c_req_up~0); 116#L416-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 64#L427-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 74#L432-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 31#L437-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 45#L442-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 112#L447-1true assume !(0 == ~e_f~0); 34#L452-1true assume !(0 == ~e_g~0); 8#L457-1true assume !(0 == ~e_e~0); 124#L462-1true assume !(0 == ~e_c~0); 23#L467-1true assume !(0 == ~e_wl~0); 103#L472-1true assume !(1 == ~wl_pc~0); 100#$Ultimate##44true assume !(2 == ~wl_pc~0); 95#L485true assume !(1 == ~c1_pc~0); 24#L495true assume !(1 == ~c2_pc~0); 77#L504true assume !(1 == ~wb_pc~0); 99#L513true assume !(1 == ~e_c~0); 15#L522-1true assume !(1 == ~e_e~0); 109#L527-1true assume !(1 == ~e_f~0); 36#L532-1true assume !(1 == ~e_g~0); 85#L537-1true assume !(1 == ~e_c~0); 56#L542-1true assume !(1 == ~e_wl~0); 106#L684-1true [2024-11-13 14:10:36,079 INFO L747 eck$LassoCheckResult]: Loop: 106#L684-1true assume !false; 136#L554true 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; 17#L389true assume false; 83#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; 22#L560true assume !(1 == ~c_req_up~0); 102#L560-2true start_simulation_~kernel_st~0#1 := 3; 113#L572true assume 0 == ~e_f~0;~e_f~0 := 1; 21#L572-2true assume 0 == ~e_g~0;~e_g~0 := 1; 50#L577-1true assume 0 == ~e_e~0;~e_e~0 := 1; 32#L582-1true assume 0 == ~e_c~0;~e_c~0 := 1; 42#L587-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 57#L592-1true assume !(1 == ~wl_pc~0); 41#$Ultimate##257true assume !(2 == ~wl_pc~0); 58#L605true assume !(1 == ~c1_pc~0); 7#L615true assume !(1 == ~c2_pc~0); 47#L624true assume !(1 == ~wb_pc~0); 130#L633true assume 1 == ~e_c~0;~r_st~0 := 0; 89#L642-1true assume 1 == ~e_e~0;~e_e~0 := 2; 25#L647-1true assume 1 == ~e_f~0;~e_f~0 := 2; 10#L652-1true assume 1 == ~e_g~0;~e_g~0 := 2; 90#L657-1true assume 1 == ~e_c~0;~e_c~0 := 2; 81#L662-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 107#L667-1true assume 0 == ~wl_st~0; 106#L684-1true [2024-11-13 14:10:36,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:36,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2024-11-13 14:10:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:36,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589807747] [2024-11-13 14:10:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:36,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589807747] [2024-11-13 14:10:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589807747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:36,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:36,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:36,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959851690] [2024-11-13 14:10:36,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:36,493 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 14:10:36,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash 80696416, now seen corresponding path program 1 times [2024-11-13 14:10:36,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:36,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229338513] [2024-11-13 14:10:36,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:36,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:36,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:36,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229338513] [2024-11-13 14:10:36,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229338513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:36,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:36,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:10:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823816879] [2024-11-13 14:10:36,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:36,543 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:10:36,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:36,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:10:36,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:10:36,583 INFO L87 Difference]: Start difference. First operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 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) [2024-11-13 14:10:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:36,605 INFO L93 Difference]: Finished difference Result 132 states and 226 transitions. [2024-11-13 14:10:36,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 226 transitions. [2024-11-13 14:10:36,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-13 14:10:36,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 126 states and 220 transitions. [2024-11-13 14:10:36,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-11-13 14:10:36,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-11-13 14:10:36,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 220 transitions. [2024-11-13 14:10:36,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:10:36,625 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2024-11-13 14:10:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 220 transitions. [2024-11-13 14:10:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-13 14:10:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.746031746031746) internal successors, (220), 125 states have internal predecessors, (220), 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) [2024-11-13 14:10:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 220 transitions. [2024-11-13 14:10:36,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2024-11-13 14:10:36,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:10:36,682 INFO L424 stractBuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2024-11-13 14:10:36,685 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 14:10:36,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 220 transitions. [2024-11-13 14:10:36,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-13 14:10:36,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:36,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:36,692 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] [2024-11-13 14:10:36,693 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] [2024-11-13 14:10:36,693 INFO L745 eck$LassoCheckResult]: Stem: 329#$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(11, 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; 330#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; 309#L416 assume !(1 == ~c_req_up~0); 311#L416-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 372#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 373#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 336#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 337#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 356#L447-1 assume !(0 == ~e_f~0); 342#L452-1 assume !(0 == ~e_g~0); 289#L457-1 assume !(0 == ~e_e~0); 290#L462-1 assume !(0 == ~e_c~0); 319#L467-1 assume !(0 == ~e_wl~0); 320#L472-1 assume !(1 == ~wl_pc~0); 395#$Ultimate##44 assume !(2 == ~wl_pc~0); 393#L485 assume !(1 == ~c1_pc~0); 321#L495 assume !(1 == ~c2_pc~0); 323#L504 assume !(1 == ~wb_pc~0); 382#L513 assume !(1 == ~e_c~0); 300#L522-1 assume !(1 == ~e_e~0); 301#L527-1 assume !(1 == ~e_f~0); 343#L532-1 assume !(1 == ~e_g~0); 344#L537-1 assume !(1 == ~e_c~0); 366#L542-1 assume !(1 == ~e_wl~0); 280#L684-1 [2024-11-13 14:10:36,694 INFO L747 eck$LassoCheckResult]: Loop: 280#L684-1 assume !false; 399#L554 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; 305#L389 assume !false; 306#L307 assume !(0 == ~wl_st~0); 361#L311 assume !(0 == ~c1_st~0); 362#L314 assume !(0 == ~c2_st~0); 281#L317 assume !(0 == ~wb_st~0); 282#L320 assume !(0 == ~r_st~0); 386#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; 316#L560 assume !(1 == ~c_req_up~0); 318#L560-2 start_simulation_~kernel_st~0#1 := 3; 397#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 315#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 338#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 339#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 353#L592-1 assume !(1 == ~wl_pc~0); 352#$Ultimate##257 assume !(2 == ~wl_pc~0); 308#L605 assume !(1 == ~c1_pc~0); 286#L615 assume !(1 == ~c2_pc~0); 288#L624 assume !(1 == ~wb_pc~0); 357#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 390#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 324#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 293#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 294#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 387#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 388#L667-1 assume 0 == ~wl_st~0; 280#L684-1 [2024-11-13 14:10:36,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2024-11-13 14:10:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:36,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040602832] [2024-11-13 14:10:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:36,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:36,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:36,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040602832] [2024-11-13 14:10:36,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040602832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:36,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:36,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413937763] [2024-11-13 14:10:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:36,883 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 14:10:36,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:36,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2067229348, now seen corresponding path program 1 times [2024-11-13 14:10:36,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:36,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967977423] [2024-11-13 14:10:36,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:36,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:36,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967977423] [2024-11-13 14:10:36,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967977423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:36,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:36,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:10:36,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123810863] [2024-11-13 14:10:36,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:36,938 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:10:36,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:36,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:10:36,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:10:36,939 INFO L87 Difference]: Start difference. First operand 126 states and 220 transitions. cyclomatic complexity: 95 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) [2024-11-13 14:10:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:36,981 INFO L93 Difference]: Finished difference Result 126 states and 219 transitions. [2024-11-13 14:10:36,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 219 transitions. [2024-11-13 14:10:36,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-13 14:10:36,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 219 transitions. [2024-11-13 14:10:36,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-11-13 14:10:36,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-11-13 14:10:36,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 219 transitions. [2024-11-13 14:10:36,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:10:36,992 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2024-11-13 14:10:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 219 transitions. [2024-11-13 14:10:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-13 14:10:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7380952380952381) internal successors, (219), 125 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) [2024-11-13 14:10:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 219 transitions. [2024-11-13 14:10:37,009 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2024-11-13 14:10:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:10:37,010 INFO L424 stractBuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2024-11-13 14:10:37,010 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 14:10:37,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 219 transitions. [2024-11-13 14:10:37,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-13 14:10:37,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:37,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:37,017 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] [2024-11-13 14:10:37,018 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] [2024-11-13 14:10:37,018 INFO L745 eck$LassoCheckResult]: Stem: 588#$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(11, 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; 589#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; 568#L416 assume !(1 == ~c_req_up~0); 570#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 631#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 632#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 597#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 598#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 615#L447-1 assume !(0 == ~e_f~0); 601#L452-1 assume !(0 == ~e_g~0); 548#L457-1 assume !(0 == ~e_e~0); 549#L462-1 assume !(0 == ~e_c~0); 578#L467-1 assume !(0 == ~e_wl~0); 579#L472-1 assume !(1 == ~wl_pc~0); 654#$Ultimate##44 assume !(2 == ~wl_pc~0); 652#L485 assume !(1 == ~c1_pc~0); 580#L495 assume !(1 == ~c2_pc~0); 582#L504 assume !(1 == ~wb_pc~0); 641#L513 assume !(1 == ~e_c~0); 559#L522-1 assume !(1 == ~e_e~0); 560#L527-1 assume !(1 == ~e_f~0); 602#L532-1 assume !(1 == ~e_g~0); 603#L537-1 assume !(1 == ~e_c~0); 625#L542-1 assume !(1 == ~e_wl~0); 539#L684-1 [2024-11-13 14:10:37,018 INFO L747 eck$LassoCheckResult]: Loop: 539#L684-1 assume !false; 658#L554 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; 564#L389 assume !false; 565#L307 assume !(0 == ~wl_st~0); 620#L311 assume !(0 == ~c1_st~0); 621#L314 assume !(0 == ~c2_st~0); 540#L317 assume !(0 == ~wb_st~0); 541#L320 assume !(0 == ~r_st~0); 645#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; 575#L560 assume !(1 == ~c_req_up~0); 577#L560-2 start_simulation_~kernel_st~0#1 := 3; 656#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 573#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 574#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 595#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 596#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 612#L592-1 assume 1 == ~wl_pc~0; 626#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 567#L605 assume !(1 == ~c1_pc~0); 545#L615 assume !(1 == ~c2_pc~0); 547#L624 assume !(1 == ~wb_pc~0); 616#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 649#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 583#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 552#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 553#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 646#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 647#L667-1 assume 0 == ~wl_st~0; 539#L684-1 [2024-11-13 14:10:37,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2024-11-13 14:10:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374231101] [2024-11-13 14:10:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:37,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:37,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:37,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374231101] [2024-11-13 14:10:37,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374231101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:37,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:37,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:37,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348028565] [2024-11-13 14:10:37,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:37,130 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 14:10:37,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:37,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1678478227, now seen corresponding path program 1 times [2024-11-13 14:10:37,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:37,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610140741] [2024-11-13 14:10:37,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:37,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:37,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:37,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:37,702 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 14:10:37,703 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 14:10:37,704 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 14:10:37,704 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 14:10:37,705 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-13 14:10:37,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:37,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 14:10:37,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 14:10:37,706 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration3_Loop [2024-11-13 14:10:37,706 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 14:10:37,706 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 14:10:37,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:37,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,218 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 14:10:38,220 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-13 14:10:38,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:38,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:38,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:38,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-13 14:10:38,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-13 14:10:38,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 14:10:38,260 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-13 14:10:38,260 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-13 14:10:38,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-13 14:10:38,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:38,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:38,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:38,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-13 14:10:38,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-13 14:10:38,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 14:10:38,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:10:38,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:38,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:38,334 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:38,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-13 14:10:38,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-13 14:10:38,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 14:10:38,363 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-13 14:10:38,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:10:38,385 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 14:10:38,385 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 14:10:38,385 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 14:10:38,385 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 14:10:38,385 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 14:10:38,385 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:38,386 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 14:10:38,386 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 14:10:38,386 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration3_Loop [2024-11-13 14:10:38,386 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 14:10:38,386 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 14:10:38,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:38,891 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 14:10:38,897 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 14:10:38,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:38,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:38,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:38,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-13 14:10:38,903 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 [2024-11-13 14:10:38,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 14:10:38,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 14:10:38,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 14:10:38,921 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-13 14:10:38,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 14:10:38,928 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-13 14:10:38,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 14:10:38,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 14:10:38,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-13 14:10:38,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:38,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:38,954 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:38,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-13 14:10:38,957 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 [2024-11-13 14:10:38,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 14:10:38,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 14:10:38,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 14:10:38,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 14:10:38,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 14:10:38,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 14:10:38,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 14:10:38,981 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 14:10:38,987 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-13 14:10:38,990 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-13 14:10:38,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:38,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:38,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:38,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-13 14:10:39,001 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 14:10:39,002 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-13 14:10:39,002 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 14:10:39,002 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-11-13 14:10:39,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-13 14:10:39,029 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-13 14:10:39,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:39,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:10:39,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:10:39,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-13 14:10:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:39,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:10:39,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:10:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:39,354 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 [2024-11-13 14:10:39,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 126 states and 219 transitions. cyclomatic complexity: 94 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) [2024-11-13 14:10:39,516 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 126 states and 219 transitions. cyclomatic complexity: 94. 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 417 states and 714 transitions. Complement of second has 5 states. [2024-11-13 14:10:39,517 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 [2024-11-13 14:10:39,518 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) [2024-11-13 14:10:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-11-13 14:10:39,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 384 transitions. Stem has 24 letters. Loop has 28 letters. [2024-11-13 14:10:39,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 14:10:39,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 384 transitions. Stem has 52 letters. Loop has 28 letters. [2024-11-13 14:10:39,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 14:10:39,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 384 transitions. Stem has 24 letters. Loop has 56 letters. [2024-11-13 14:10:39,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 14:10:39,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 417 states and 714 transitions. [2024-11-13 14:10:39,547 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 285 [2024-11-13 14:10:39,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 417 states to 417 states and 714 transitions. [2024-11-13 14:10:39,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2024-11-13 14:10:39,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 320 [2024-11-13 14:10:39,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 714 transitions. [2024-11-13 14:10:39,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:39,560 INFO L218 hiAutomatonCegarLoop]: Abstraction has 417 states and 714 transitions. [2024-11-13 14:10:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 714 transitions. [2024-11-13 14:10:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 319. [2024-11-13 14:10:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 319 states have (on average 1.7178683385579938) internal successors, (548), 318 states have internal predecessors, (548), 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) [2024-11-13 14:10:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 548 transitions. [2024-11-13 14:10:39,590 INFO L240 hiAutomatonCegarLoop]: Abstraction has 319 states and 548 transitions. [2024-11-13 14:10:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:39,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:10:39,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:10:39,591 INFO L87 Difference]: Start difference. First operand 319 states and 548 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) [2024-11-13 14:10:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:39,617 INFO L93 Difference]: Finished difference Result 319 states and 547 transitions. [2024-11-13 14:10:39,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 547 transitions. [2024-11-13 14:10:39,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 190 [2024-11-13 14:10:39,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 319 states and 547 transitions. [2024-11-13 14:10:39,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2024-11-13 14:10:39,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2024-11-13 14:10:39,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 547 transitions. [2024-11-13 14:10:39,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:39,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 319 states and 547 transitions. [2024-11-13 14:10:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 547 transitions. [2024-11-13 14:10:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-11-13 14:10:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 319 states have (on average 1.7147335423197492) internal successors, (547), 318 states have internal predecessors, (547), 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) [2024-11-13 14:10:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 547 transitions. [2024-11-13 14:10:39,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 319 states and 547 transitions. [2024-11-13 14:10:39,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:10:39,656 INFO L424 stractBuchiCegarLoop]: Abstraction has 319 states and 547 transitions. [2024-11-13 14:10:39,657 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 14:10:39,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 319 states and 547 transitions. [2024-11-13 14:10:39,659 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 190 [2024-11-13 14:10:39,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:39,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:39,662 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] [2024-11-13 14:10:39,662 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] [2024-11-13 14:10:39,663 INFO L745 eck$LassoCheckResult]: Stem: 1986#$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(11, 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; 1987#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; 1953#L416 assume !(1 == ~c_req_up~0); 1955#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 2070#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 2071#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1998#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 1999#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 2035#L447-1 assume !(0 == ~e_f~0); 2009#L452-1 assume !(0 == ~e_g~0); 1917#L457-1 assume !(0 == ~e_e~0); 1918#L462-1 assume !(0 == ~e_c~0); 1970#L467-1 assume !(0 == ~e_wl~0); 1971#L472-1 assume !(1 == ~wl_pc~0); 2115#$Ultimate##44 assume !(2 == ~wl_pc~0); 2112#L485 assume !(1 == ~c1_pc~0); 1972#L495 assume !(1 == ~c2_pc~0); 1974#L504 assume !(1 == ~wb_pc~0); 2089#L513 assume !(1 == ~e_c~0); 1937#L522-1 assume !(1 == ~e_e~0); 1938#L527-1 assume !(1 == ~e_f~0); 2010#L532-1 assume !(1 == ~e_g~0); 2011#L537-1 assume !(1 == ~e_c~0); 2055#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1904#L684-1 [2024-11-13 14:10:39,663 INFO L747 eck$LassoCheckResult]: Loop: 1904#L684-1 assume !false; 2121#L554 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; 2154#L389 assume !false; 2088#L307 assume !(0 == ~wl_st~0); 2045#L311 assume !(0 == ~c1_st~0); 2046#L314 assume !(0 == ~c2_st~0); 1897#L317 assume !(0 == ~wb_st~0); 1898#L320 assume !(0 == ~r_st~0); 2095#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; 1964#L560 assume !(1 == ~c_req_up~0); 1966#L560-2 start_simulation_~kernel_st~0#1 := 3; 2123#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 2124#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2144#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2000#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 2001#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 2030#L592-1 assume 1 == ~wl_pc~0; 2130#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1950#L605 assume !(1 == ~c1_pc~0); 2140#L615 assume !(1 == ~c2_pc~0); 2138#L624 assume !(1 == ~wb_pc~0); 2136#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 2135#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1975#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1976#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2134#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2097#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2098#L667-1 assume 0 == ~wl_st~0; 1904#L684-1 [2024-11-13 14:10:39,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:39,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539629, now seen corresponding path program 1 times [2024-11-13 14:10:39,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:39,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745286890] [2024-11-13 14:10:39,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:39,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:39,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:39,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745286890] [2024-11-13 14:10:39,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745286890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:39,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:39,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:39,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046896542] [2024-11-13 14:10:39,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:39,726 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 14:10:39,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1678478227, now seen corresponding path program 2 times [2024-11-13 14:10:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:39,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385542551] [2024-11-13 14:10:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:39,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:39,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:40,097 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 14:10:40,097 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 14:10:40,098 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 14:10:40,098 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 14:10:40,098 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-13 14:10:40,098 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:40,098 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 14:10:40,098 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 14:10:40,098 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration4_Loop [2024-11-13 14:10:40,098 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 14:10:40,098 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 14:10:40,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,567 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 14:10:40,570 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-13 14:10:40,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:40,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:40,575 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:40,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-13 14:10:40,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-13 14:10:40,579 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 14:10:40,607 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-13 14:10:40,608 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-13 14:10:40,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-13 14:10:40,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:40,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:40,624 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:40,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-13 14:10:40,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-13 14:10:40,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 14:10:40,651 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-13 14:10:40,651 INFO L401 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: [] [2024-11-13 14:10:40,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-13 14:10:40,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:40,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:40,678 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:40,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-13 14:10:40,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-13 14:10:40,684 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 14:10:40,710 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-13 14:10:40,710 INFO L401 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: [] [2024-11-13 14:10:40,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-13 14:10:40,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:40,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:40,743 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:40,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-13 14:10:40,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-13 14:10:40,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 14:10:40,780 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-13 14:10:40,780 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-13 14:10:40,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-13 14:10:40,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:40,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:40,808 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:40,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-13 14:10:40,812 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-13 14:10:40,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 14:10:40,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-13 14:10:40,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:40,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:40,859 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:40,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-13 14:10:40,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-13 14:10:40,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 14:10:40,880 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-13 14:10:40,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-13 14:10:40,896 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 14:10:40,896 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 14:10:40,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 14:10:40,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 14:10:40,896 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 14:10:40,896 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:40,896 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 14:10:40,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 14:10:40,896 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration4_Loop [2024-11-13 14:10:40,897 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 14:10:40,897 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 14:10:40,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:40,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:41,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:41,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:41,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:41,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:41,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:41,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:41,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:41,355 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 14:10:41,359 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 14:10:41,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:41,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:41,365 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:41,369 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 [2024-11-13 14:10:41,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-13 14:10:41,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 14:10:41,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 14:10:41,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 14:10:41,388 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-13 14:10:41,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 14:10:41,389 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-13 14:10:41,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 14:10:41,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 14:10:41,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-13 14:10:41,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:41,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:41,418 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:41,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-13 14:10:41,424 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 [2024-11-13 14:10:41,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 14:10:41,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 14:10:41,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 14:10:41,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 14:10:41,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 14:10:41,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 14:10:41,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 14:10:41,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 14:10:41,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-13 14:10:41,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:41,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:41,474 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:41,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-13 14:10:41,477 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 [2024-11-13 14:10:41,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 14:10:41,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 14:10:41,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 14:10:41,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 14:10:41,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 14:10:41,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 14:10:41,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 14:10:41,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 14:10:41,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-13 14:10:41,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:41,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:41,524 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:41,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-13 14:10:41,527 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 [2024-11-13 14:10:41,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 14:10:41,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 14:10:41,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 14:10:41,546 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-13 14:10:41,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 14:10:41,550 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-13 14:10:41,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 14:10:41,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 14:10:41,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-13 14:10:41,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:41,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:41,582 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:41,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-13 14:10:41,587 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 [2024-11-13 14:10:41,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 14:10:41,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 14:10:41,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 14:10:41,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 14:10:41,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 14:10:41,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 14:10:41,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 14:10:41,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 14:10:41,614 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-13 14:10:41,614 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-13 14:10:41,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:41,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:41,617 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:41,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-13 14:10:41,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 14:10:41,621 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-13 14:10:41,621 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 14:10:41,621 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-11-13 14:10:41,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-13 14:10:41,646 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-13 14:10:41,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:41,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:10:41,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:10:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:41,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:10:41,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:10:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:41,903 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 [2024-11-13 14:10:41,903 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 319 states and 547 transitions. cyclomatic complexity: 231 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) [2024-11-13 14:10:41,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-13 14:10:42,010 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 319 states and 547 transitions. cyclomatic complexity: 231. 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 610 states and 1042 transitions. Complement of second has 5 states. [2024-11-13 14:10:42,011 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 [2024-11-13 14:10:42,012 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) [2024-11-13 14:10:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2024-11-13 14:10:42,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 24 letters. Loop has 28 letters. [2024-11-13 14:10:42,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 14:10:42,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 52 letters. Loop has 28 letters. [2024-11-13 14:10:42,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 14:10:42,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 24 letters. Loop has 56 letters. [2024-11-13 14:10:42,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 14:10:42,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 610 states and 1042 transitions. [2024-11-13 14:10:42,026 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 380 [2024-11-13 14:10:42,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 610 states to 610 states and 1042 transitions. [2024-11-13 14:10:42,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 413 [2024-11-13 14:10:42,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2024-11-13 14:10:42,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 610 states and 1042 transitions. [2024-11-13 14:10:42,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:42,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 610 states and 1042 transitions. [2024-11-13 14:10:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states and 1042 transitions. [2024-11-13 14:10:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 319. [2024-11-13 14:10:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 319 states have (on average 1.7147335423197492) internal successors, (547), 318 states have internal predecessors, (547), 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) [2024-11-13 14:10:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 547 transitions. [2024-11-13 14:10:42,068 INFO L240 hiAutomatonCegarLoop]: Abstraction has 319 states and 547 transitions. [2024-11-13 14:10:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:42,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:10:42,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:10:42,069 INFO L87 Difference]: Start difference. First operand 319 states and 547 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) [2024-11-13 14:10:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:42,084 INFO L93 Difference]: Finished difference Result 319 states and 546 transitions. [2024-11-13 14:10:42,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 546 transitions. [2024-11-13 14:10:42,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 190 [2024-11-13 14:10:42,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 319 states and 546 transitions. [2024-11-13 14:10:42,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2024-11-13 14:10:42,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2024-11-13 14:10:42,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 546 transitions. [2024-11-13 14:10:42,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:42,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 319 states and 546 transitions. [2024-11-13 14:10:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 546 transitions. [2024-11-13 14:10:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-11-13 14:10:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 319 states have (on average 1.7115987460815048) internal successors, (546), 318 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) [2024-11-13 14:10:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 546 transitions. [2024-11-13 14:10:42,111 INFO L240 hiAutomatonCegarLoop]: Abstraction has 319 states and 546 transitions. [2024-11-13 14:10:42,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:10:42,112 INFO L424 stractBuchiCegarLoop]: Abstraction has 319 states and 546 transitions. [2024-11-13 14:10:42,112 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 14:10:42,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 319 states and 546 transitions. [2024-11-13 14:10:42,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 190 [2024-11-13 14:10:42,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:42,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:42,119 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] [2024-11-13 14:10:42,120 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] [2024-11-13 14:10:42,121 INFO L745 eck$LassoCheckResult]: Stem: 3731#$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(11, 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; 3732#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; 3700#L416 assume !(1 == ~c_req_up~0); 3702#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3814#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3815#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3743#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3744#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3778#L447-1 assume !(0 == ~e_f~0); 3754#L452-1 assume !(0 == ~e_g~0); 3660#L457-1 assume !(0 == ~e_e~0); 3661#L462-1 assume !(0 == ~e_c~0); 3713#L467-1 assume !(0 == ~e_wl~0); 3714#L472-1 assume !(1 == ~wl_pc~0); 3864#$Ultimate##44 assume !(2 == ~wl_pc~0); 3861#L485 assume !(1 == ~c1_pc~0); 3715#L495 assume !(1 == ~c2_pc~0); 3717#L504 assume !(1 == ~wb_pc~0); 3835#L513 assume !(1 == ~e_c~0); 3680#L522-1 assume !(1 == ~e_e~0); 3681#L527-1 assume !(1 == ~e_f~0); 3755#L532-1 assume !(1 == ~e_g~0); 3756#L537-1 assume !(1 == ~e_c~0); 3798#L542-1 assume !(1 == ~e_wl~0); 3799#L684-1 assume !false; 3871#L554 [2024-11-13 14:10:42,121 INFO L747 eck$LassoCheckResult]: Loop: 3871#L554 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; 3899#L389 assume !false; 3898#L307 assume !(0 == ~wl_st~0); 3792#L311 assume !(0 == ~c1_st~0); 3793#L314 assume !(0 == ~c2_st~0); 3640#L317 assume !(0 == ~wb_st~0); 3641#L320 assume !(0 == ~r_st~0); 3841#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; 3848#L560 assume !(1 == ~c_req_up~0); 3866#L560-2 start_simulation_~kernel_st~0#1 := 3; 3867#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 3703#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3704#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3787#L582-1 assume !(0 == ~e_c~0); 3892#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3800#L592-1 assume !(1 == ~wl_pc~0); 3801#$Ultimate##257 assume !(2 == ~wl_pc~0); 3804#L605 assume !(1 == ~c1_pc~0); 3654#L615 assume !(1 == ~c2_pc~0); 3656#L624 assume !(1 == ~wb_pc~0); 3779#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 3851#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3852#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3666#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3667#L657-1 assume !(1 == ~e_c~0); 3854#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3952#L667-1 assume 0 == ~wl_st~0; 3870#L684-1 assume !false; 3871#L554 [2024-11-13 14:10:42,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash -666176965, now seen corresponding path program 1 times [2024-11-13 14:10:42,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:42,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856957712] [2024-11-13 14:10:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:42,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:42,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:42,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash 924330822, now seen corresponding path program 1 times [2024-11-13 14:10:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:42,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705060395] [2024-11-13 14:10:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:42,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:42,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:42,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705060395] [2024-11-13 14:10:42,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705060395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:42,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:42,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:42,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71590597] [2024-11-13 14:10:42,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:42,208 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:10:42,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:42,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:10:42,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:10:42,209 INFO L87 Difference]: Start difference. First operand 319 states and 546 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) [2024-11-13 14:10:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:42,264 INFO L93 Difference]: Finished difference Result 381 states and 661 transitions. [2024-11-13 14:10:42,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 661 transitions. [2024-11-13 14:10:42,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2024-11-13 14:10:42,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 366 states and 631 transitions. [2024-11-13 14:10:42,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2024-11-13 14:10:42,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2024-11-13 14:10:42,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 631 transitions. [2024-11-13 14:10:42,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:42,274 INFO L218 hiAutomatonCegarLoop]: Abstraction has 366 states and 631 transitions. [2024-11-13 14:10:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 631 transitions. [2024-11-13 14:10:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-11-13 14:10:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.7240437158469946) internal successors, (631), 365 states have internal predecessors, (631), 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) [2024-11-13 14:10:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 631 transitions. [2024-11-13 14:10:42,286 INFO L240 hiAutomatonCegarLoop]: Abstraction has 366 states and 631 transitions. [2024-11-13 14:10:42,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:10:42,287 INFO L424 stractBuchiCegarLoop]: Abstraction has 366 states and 631 transitions. [2024-11-13 14:10:42,287 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 14:10:42,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 631 transitions. [2024-11-13 14:10:42,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2024-11-13 14:10:42,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:42,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:42,292 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] [2024-11-13 14:10:42,293 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] [2024-11-13 14:10:42,294 INFO L745 eck$LassoCheckResult]: Stem: 4440#$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(11, 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; 4441#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; 4407#L416 assume !(1 == ~c_req_up~0); 4409#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4516#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4517#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4453#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4454#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4485#L447-1 assume !(0 == ~e_f~0); 4461#L452-1 assume !(0 == ~e_g~0); 4366#L457-1 assume !(0 == ~e_e~0); 4367#L462-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4577#L467-1 assume !(0 == ~e_wl~0); 4564#L472-1 assume !(1 == ~wl_pc~0); 4562#$Ultimate##44 assume !(2 == ~wl_pc~0); 4556#L485 assume !(1 == ~c1_pc~0); 4422#L495 assume !(1 == ~c2_pc~0); 4424#L504 assume !(1 == ~wb_pc~0); 4534#L513 assume 1 == ~e_c~0;~r_st~0 := 0; 4559#L522-1 assume !(1 == ~e_e~0); 4568#L527-1 assume !(1 == ~e_f~0); 4462#L532-1 assume !(1 == ~e_g~0); 4463#L537-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4504#L542-1 assume !(1 == ~e_wl~0); 4505#L684-1 assume !false; 4578#L554 [2024-11-13 14:10:42,294 INFO L747 eck$LassoCheckResult]: Loop: 4578#L554 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; 4403#L389 assume !false; 4620#L307 assume !(0 == ~wl_st~0); 4619#L311 assume !(0 == ~c1_st~0); 4618#L314 assume !(0 == ~c2_st~0); 4617#L317 assume !(0 == ~wb_st~0); 4616#L320 assume !(0 == ~r_st~0); 4615#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; 4613#L560 assume !(1 == ~c_req_up~0); 4611#L560-2 start_simulation_~kernel_st~0#1 := 3; 4610#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 4410#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 4411#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 4448#L582-1 assume !(0 == ~e_c~0); 4449#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4683#L592-1 assume 1 == ~wl_pc~0; 4681#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4679#L605 assume !(1 == ~c1_pc~0); 4677#L615 assume !(1 == ~c2_pc~0); 4675#L624 assume !(1 == ~wb_pc~0); 4673#L633 assume !(1 == ~e_c~0); 4672#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4425#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4372#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4373#L657-1 assume !(1 == ~e_c~0); 4550#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4630#L667-1 assume 0 == ~wl_st~0; 4625#L684-1 assume !false; 4578#L554 [2024-11-13 14:10:42,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:42,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1430068999, now seen corresponding path program 1 times [2024-11-13 14:10:42,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:42,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815985336] [2024-11-13 14:10:42,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:42,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:42,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:42,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815985336] [2024-11-13 14:10:42,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815985336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:42,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:42,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:10:42,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740192246] [2024-11-13 14:10:42,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:42,383 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 14:10:42,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash 267802029, now seen corresponding path program 1 times [2024-11-13 14:10:42,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:42,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758459506] [2024-11-13 14:10:42,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:42,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:42,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:42,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:42,698 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 14:10:42,698 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 14:10:42,698 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 14:10:42,698 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 14:10:42,698 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-13 14:10:42,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:42,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 14:10:42,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 14:10:42,699 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration6_Loop [2024-11-13 14:10:42,699 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 14:10:42,699 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 14:10:42,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:42,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,109 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 14:10:43,110 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-13 14:10:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:43,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:43,112 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:43,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-13 14:10:43,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-13 14:10:43,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 14:10:43,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-13 14:10:43,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:43,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:43,156 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:43,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-13 14:10:43,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-13 14:10:43,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 14:10:43,184 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-13 14:10:43,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-13 14:10:43,208 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 14:10:43,208 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 14:10:43,209 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 14:10:43,209 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 14:10:43,209 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 14:10:43,209 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:43,209 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 14:10:43,209 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 14:10:43,209 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration6_Loop [2024-11-13 14:10:43,209 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 14:10:43,209 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 14:10:43,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 14:10:43,638 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 14:10:43,638 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 14:10:43,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:43,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:43,641 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:43,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-13 14:10:43,646 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 [2024-11-13 14:10:43,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 14:10:43,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 14:10:43,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 14:10:43,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 14:10:43,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 14:10:43,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 14:10:43,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 14:10:43,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 14:10:43,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-13 14:10:43,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:43,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:43,698 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:43,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-13 14:10:43,702 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 [2024-11-13 14:10:43,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 14:10:43,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 14:10:43,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 14:10:43,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 14:10:43,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 14:10:43,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 14:10:43,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 14:10:43,726 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 14:10:43,729 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-13 14:10:43,729 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-13 14:10:43,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:10:43,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:43,732 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 14:10:43,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-13 14:10:43,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 14:10:43,737 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-13 14:10:43,737 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 14:10:43,737 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] [2024-11-13 14:10:43,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-13 14:10:43,762 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-13 14:10:43,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:43,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:10:43,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:10:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:43,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:10:43,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:10:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:44,015 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 [2024-11-13 14:10:44,016 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 366 states and 631 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) [2024-11-13 14:10:44,097 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 366 states and 631 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 989 states and 1699 transitions. Complement of second has 5 states. [2024-11-13 14:10:44,098 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 [2024-11-13 14:10:44,098 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) [2024-11-13 14:10:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-11-13 14:10:44,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 213 transitions. Stem has 25 letters. Loop has 28 letters. [2024-11-13 14:10:44,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 14:10:44,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 213 transitions. Stem has 53 letters. Loop has 28 letters. [2024-11-13 14:10:44,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 14:10:44,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 213 transitions. Stem has 25 letters. Loop has 56 letters. [2024-11-13 14:10:44,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 14:10:44,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 989 states and 1699 transitions. [2024-11-13 14:10:44,114 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 390 [2024-11-13 14:10:44,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 989 states to 971 states and 1675 transitions. [2024-11-13 14:10:44,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 452 [2024-11-13 14:10:44,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 458 [2024-11-13 14:10:44,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 971 states and 1675 transitions. [2024-11-13 14:10:44,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:44,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 971 states and 1675 transitions. [2024-11-13 14:10:44,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states and 1675 transitions. [2024-11-13 14:10:44,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-13 14:10:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 947. [2024-11-13 14:10:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 947 states have (on average 1.7370644139387539) internal successors, (1645), 946 states have internal predecessors, (1645), 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) [2024-11-13 14:10:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1645 transitions. [2024-11-13 14:10:44,206 INFO L240 hiAutomatonCegarLoop]: Abstraction has 947 states and 1645 transitions. [2024-11-13 14:10:44,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:44,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:10:44,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:10:44,207 INFO L87 Difference]: Start difference. First operand 947 states and 1645 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) [2024-11-13 14:10:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:44,384 INFO L93 Difference]: Finished difference Result 1320 states and 2251 transitions. [2024-11-13 14:10:44,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1320 states and 2251 transitions. [2024-11-13 14:10:44,398 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 486 [2024-11-13 14:10:44,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1320 states to 1320 states and 2251 transitions. [2024-11-13 14:10:44,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 575 [2024-11-13 14:10:44,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2024-11-13 14:10:44,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1320 states and 2251 transitions. [2024-11-13 14:10:44,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:44,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1320 states and 2251 transitions. [2024-11-13 14:10:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states and 2251 transitions. [2024-11-13 14:10:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1128. [2024-11-13 14:10:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1128 states have (on average 1.7163120567375887) internal successors, (1936), 1127 states have internal predecessors, (1936), 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) [2024-11-13 14:10:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1936 transitions. [2024-11-13 14:10:44,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1128 states and 1936 transitions. [2024-11-13 14:10:44,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:10:44,451 INFO L424 stractBuchiCegarLoop]: Abstraction has 1128 states and 1936 transitions. [2024-11-13 14:10:44,451 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 14:10:44,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1128 states and 1936 transitions. [2024-11-13 14:10:44,459 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 402 [2024-11-13 14:10:44,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:44,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:44,460 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] [2024-11-13 14:10:44,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:44,461 INFO L745 eck$LassoCheckResult]: Stem: 8241#$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(11, 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; 8242#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; 8206#L416 assume !(1 == ~c_req_up~0); 8208#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 8416#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 8439#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 8254#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 8255#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8410#L447-1 assume !(0 == ~e_f~0); 8264#L452-1 assume !(0 == ~e_g~0); 8265#L457-1 assume !(0 == ~e_e~0); 8427#L462-1 assume !(0 == ~e_c~0); 8428#L467-1 assume !(0 == ~e_wl~0); 8721#L472-1 assume !(1 == ~wl_pc~0); 8719#$Ultimate##44 assume !(2 == ~wl_pc~0); 8717#L485 assume !(1 == ~c1_pc~0); 8454#L495 assume !(1 == ~c2_pc~0); 8453#L504 assume !(1 == ~wb_pc~0); 8447#L513 assume 1 == ~e_c~0;~r_st~0 := 0; 8191#L522-1 assume !(1 == ~e_e~0); 8192#L527-1 assume !(1 == ~e_f~0); 8266#L532-1 assume !(1 == ~e_g~0); 8267#L537-1 assume 1 == ~e_c~0;~e_c~0 := 2; 8317#L542-1 assume !(1 == ~e_wl~0); 8318#L684-1 assume !false; 8686#L554 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; 8198#L389 [2024-11-13 14:10:44,461 INFO L747 eck$LassoCheckResult]: Loop: 8198#L389 assume !false; 8199#L307 assume 0 == ~wl_st~0; 8152#L320-1 assume !(0 == ~wl_st~0); 8233#L329 assume !(0 == ~c1_st~0); 8186#L344 assume !(0 == ~c2_st~0); 8244#L359 assume !(0 == ~wb_st~0); 8181#L374 assume !(0 == ~r_st~0); 8198#L389 [2024-11-13 14:10:44,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1632637789, now seen corresponding path program 1 times [2024-11-13 14:10:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:44,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427544080] [2024-11-13 14:10:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:44,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:44,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:44,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427544080] [2024-11-13 14:10:44,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427544080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:44,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:44,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379465821] [2024-11-13 14:10:44,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:44,535 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 14:10:44,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:44,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1701895435, now seen corresponding path program 1 times [2024-11-13 14:10:44,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:44,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405498554] [2024-11-13 14:10:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:44,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405498554] [2024-11-13 14:10:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405498554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:44,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:44,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:44,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695353525] [2024-11-13 14:10:44,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:44,549 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:10:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:44,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:10:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:10:44,550 INFO L87 Difference]: Start difference. First operand 1128 states and 1936 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) [2024-11-13 14:10:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:44,614 INFO L93 Difference]: Finished difference Result 1798 states and 3049 transitions. [2024-11-13 14:10:44,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1798 states and 3049 transitions. [2024-11-13 14:10:44,631 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 648 [2024-11-13 14:10:44,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1798 states to 1798 states and 3049 transitions. [2024-11-13 14:10:44,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 728 [2024-11-13 14:10:44,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 728 [2024-11-13 14:10:44,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1798 states and 3049 transitions. [2024-11-13 14:10:44,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:44,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1798 states and 3049 transitions. [2024-11-13 14:10:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states and 3049 transitions. [2024-11-13 14:10:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1798. [2024-11-13 14:10:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1798 states have (on average 1.6957730812013347) internal successors, (3049), 1797 states have internal predecessors, (3049), 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) [2024-11-13 14:10:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 3049 transitions. [2024-11-13 14:10:44,730 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1798 states and 3049 transitions. [2024-11-13 14:10:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:10:44,731 INFO L424 stractBuchiCegarLoop]: Abstraction has 1798 states and 3049 transitions. [2024-11-13 14:10:44,732 INFO L331 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-13 14:10:44,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1798 states and 3049 transitions. [2024-11-13 14:10:44,743 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 648 [2024-11-13 14:10:44,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:44,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:44,744 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] [2024-11-13 14:10:44,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:44,745 INFO L745 eck$LassoCheckResult]: Stem: 11178#$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(11, 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; 11179#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; 11142#L416 assume !(1 == ~c_req_up~0); 11144#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 11350#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 11370#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 11190#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 11191#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 11344#L447-1 assume !(0 == ~e_f~0); 11200#L452-1 assume !(0 == ~e_g~0); 11201#L457-1 assume !(0 == ~e_e~0); 11359#L462-1 assume !(0 == ~e_c~0); 11360#L467-1 assume !(0 == ~e_wl~0); 11782#L472-1 assume !(1 == ~wl_pc~0); 11779#$Ultimate##44 assume !(2 == ~wl_pc~0); 11777#L485 assume !(1 == ~c1_pc~0); 11775#L495 assume !(1 == ~c2_pc~0); 11291#L504 assume !(1 == ~wb_pc~0); 11292#L513 assume 1 == ~e_c~0;~r_st~0 := 0; 11328#L522-1 assume !(1 == ~e_e~0); 11371#L527-1 assume !(1 == ~e_f~0); 11202#L532-1 assume !(1 == ~e_g~0); 11203#L537-1 assume 1 == ~e_c~0;~e_c~0 := 2; 11252#L542-1 assume !(1 == ~e_wl~0); 11253#L684-1 assume !false; 11738#L554 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; 12057#L389 [2024-11-13 14:10:44,745 INFO L747 eck$LassoCheckResult]: Loop: 12057#L389 assume !false; 12599#L307 assume 0 == ~wl_st~0; 12464#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 12551#L333 assume !(0 != eval_~tmp~0#1); 12592#L329 assume !(0 == ~c1_st~0); 12627#L344 assume !(0 == ~c2_st~0); 12620#L359 assume !(0 == ~wb_st~0); 12616#L374 assume !(0 == ~r_st~0); 12057#L389 [2024-11-13 14:10:44,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1632637789, now seen corresponding path program 2 times [2024-11-13 14:10:44,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:44,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144730168] [2024-11-13 14:10:44,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:44,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:44,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144730168] [2024-11-13 14:10:44,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144730168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144865130] [2024-11-13 14:10:44,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:44,807 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 14:10:44,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 270270338, now seen corresponding path program 1 times [2024-11-13 14:10:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567053596] [2024-11-13 14:10:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:44,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:44,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:44,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:44,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:10:44,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:10:44,863 INFO L87 Difference]: Start difference. First operand 1798 states and 3049 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) [2024-11-13 14:10:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:44,939 INFO L93 Difference]: Finished difference Result 3106 states and 5208 transitions. [2024-11-13 14:10:44,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3106 states and 5208 transitions. [2024-11-13 14:10:44,969 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1230 [2024-11-13 14:10:44,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3106 states to 2530 states and 4246 transitions. [2024-11-13 14:10:44,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1315 [2024-11-13 14:10:44,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1347 [2024-11-13 14:10:44,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2530 states and 4246 transitions. [2024-11-13 14:10:44,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:44,992 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2530 states and 4246 transitions. [2024-11-13 14:10:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states and 4246 transitions. [2024-11-13 14:10:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 1641. [2024-11-13 14:10:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1641 states have (on average 1.6892138939670933) internal successors, (2772), 1640 states have internal predecessors, (2772), 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) [2024-11-13 14:10:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2772 transitions. [2024-11-13 14:10:45,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1641 states and 2772 transitions. [2024-11-13 14:10:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:10:45,057 INFO L424 stractBuchiCegarLoop]: Abstraction has 1641 states and 2772 transitions. [2024-11-13 14:10:45,059 INFO L331 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-13 14:10:45,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1641 states and 2772 transitions. [2024-11-13 14:10:45,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 648 [2024-11-13 14:10:45,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:45,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:45,072 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] [2024-11-13 14:10:45,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:45,074 INFO L745 eck$LassoCheckResult]: Stem: 16084#$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(11, 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; 16085#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; 16050#L416 assume !(1 == ~c_req_up~0); 16052#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 16253#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 16266#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16096#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16097#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16246#L447-1 assume !(0 == ~e_f~0); 16106#L452-1 assume !(0 == ~e_g~0); 16013#L457-1 assume !(0 == ~e_e~0); 16014#L462-1 assume !(0 == ~e_c~0); 16068#L467-1 assume !(0 == ~e_wl~0); 16069#L472-1 assume !(1 == ~wl_pc~0); 16287#$Ultimate##44 assume !(2 == ~wl_pc~0); 16284#L485 assume !(1 == ~c1_pc~0); 16281#L495 assume !(1 == ~c2_pc~0); 16277#L504 assume !(1 == ~wb_pc~0); 16227#L513 assume !(1 == ~e_c~0); 16033#L522-1 assume !(1 == ~e_e~0); 16034#L527-1 assume 1 == ~e_f~0;~e_f~0 := 2; 16299#L532-1 assume !(1 == ~e_g~0); 16213#L537-1 assume !(1 == ~e_c~0); 16214#L542-1 assume !(1 == ~e_wl~0); 16951#L684-1 assume !false; 16436#L554 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; 16040#L389 [2024-11-13 14:10:45,074 INFO L747 eck$LassoCheckResult]: Loop: 16040#L389 assume !false; 16041#L307 assume 0 == ~wl_st~0; 17174#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 16167#L333 assume !(0 != eval_~tmp~0#1); 16109#L329 assume !(0 == ~c1_st~0); 16029#L344 assume !(0 == ~c2_st~0); 16087#L359 assume !(0 == ~wb_st~0); 17201#L374 assume !(0 == ~r_st~0); 16040#L389 [2024-11-13 14:10:45,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash 766092443, now seen corresponding path program 1 times [2024-11-13 14:10:45,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:45,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141525738] [2024-11-13 14:10:45,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:45,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:45,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141525738] [2024-11-13 14:10:45,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141525738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:45,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:45,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:10:45,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833278829] [2024-11-13 14:10:45,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:45,143 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 14:10:45,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:45,144 INFO L85 PathProgramCache]: Analyzing trace with hash 270270338, now seen corresponding path program 2 times [2024-11-13 14:10:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453100270] [2024-11-13 14:10:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:45,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:45,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:45,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:10:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:10:45,198 INFO L87 Difference]: Start difference. First operand 1641 states and 2772 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) [2024-11-13 14:10:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:45,416 INFO L93 Difference]: Finished difference Result 2133 states and 3580 transitions. [2024-11-13 14:10:45,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2133 states and 3580 transitions. [2024-11-13 14:10:45,434 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 872 [2024-11-13 14:10:45,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2133 states to 2133 states and 3580 transitions. [2024-11-13 14:10:45,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1082 [2024-11-13 14:10:45,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1082 [2024-11-13 14:10:45,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2133 states and 3580 transitions. [2024-11-13 14:10:45,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:45,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2133 states and 3580 transitions. [2024-11-13 14:10:45,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states and 3580 transitions. [2024-11-13 14:10:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 1944. [2024-11-13 14:10:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1944 states have (on average 1.6856995884773662) internal successors, (3277), 1943 states have internal predecessors, (3277), 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) [2024-11-13 14:10:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 3277 transitions. [2024-11-13 14:10:45,523 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1944 states and 3277 transitions. [2024-11-13 14:10:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:10:45,525 INFO L424 stractBuchiCegarLoop]: Abstraction has 1944 states and 3277 transitions. [2024-11-13 14:10:45,525 INFO L331 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-13 14:10:45,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1944 states and 3277 transitions. [2024-11-13 14:10:45,540 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 730 [2024-11-13 14:10:45,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:45,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:45,541 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] [2024-11-13 14:10:45,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:45,542 INFO L745 eck$LassoCheckResult]: Stem: 19868#$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(11, 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; 19869#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; 19835#L416 assume !(1 == ~c_req_up~0); 19837#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 20041#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 19983#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 19984#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 19920#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 19921#L447-1 assume !(0 == ~e_f~0); 20093#L452-1 assume !(0 == ~e_g~0); 20092#L457-1 assume !(0 == ~e_e~0); 20091#L462-1 assume !(0 == ~e_c~0); 20090#L467-1 assume !(0 == ~e_wl~0); 20089#L472-1 assume !(1 == ~wl_pc~0); 20087#$Ultimate##44 assume !(2 == ~wl_pc~0); 20085#L485 assume !(1 == ~c1_pc~0); 20083#L495 assume !(1 == ~c2_pc~0); 20081#L504 assume !(1 == ~wb_pc~0); 20078#L513 assume !(1 == ~e_c~0); 20076#L522-1 assume !(1 == ~e_e~0); 20073#L527-1 assume !(1 == ~e_f~0); 20071#L532-1 assume !(1 == ~e_g~0); 20002#L537-1 assume !(1 == ~e_c~0); 19945#L542-1 assume !(1 == ~e_wl~0); 19946#L684-1 assume !false; 20978#L554 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; 19825#L389 [2024-11-13 14:10:45,542 INFO L747 eck$LassoCheckResult]: Loop: 19825#L389 assume !false; 19826#L307 assume 0 == ~wl_st~0; 19860#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 19861#L333 assume !(0 != eval_~tmp~0#1); 19894#L329 assume !(0 == ~c1_st~0); 19813#L344 assume !(0 == ~c2_st~0); 19871#L359 assume !(0 == ~wb_st~0); 19808#L374 assume !(0 == ~r_st~0); 19825#L389 [2024-11-13 14:10:45,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash 823350745, now seen corresponding path program 1 times [2024-11-13 14:10:45,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:45,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475688835] [2024-11-13 14:10:45,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:45,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:45,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:45,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash 270270338, now seen corresponding path program 3 times [2024-11-13 14:10:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:45,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40544445] [2024-11-13 14:10:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:45,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:45,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:45,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1355283802, now seen corresponding path program 1 times [2024-11-13 14:10:45,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:45,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960164607] [2024-11-13 14:10:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:45,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:45,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960164607] [2024-11-13 14:10:45,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960164607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:45,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:45,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:45,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584687125] [2024-11-13 14:10:45,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:45,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:45,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:10:45,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:10:45,695 INFO L87 Difference]: Start difference. First operand 1944 states and 3277 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) [2024-11-13 14:10:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:45,768 INFO L93 Difference]: Finished difference Result 3078 states and 5129 transitions. [2024-11-13 14:10:45,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3078 states and 5129 transitions. [2024-11-13 14:10:45,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1138 [2024-11-13 14:10:45,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3078 states to 3078 states and 5129 transitions. [2024-11-13 14:10:45,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1398 [2024-11-13 14:10:45,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1398 [2024-11-13 14:10:45,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3078 states and 5129 transitions. [2024-11-13 14:10:45,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:45,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3078 states and 5129 transitions. [2024-11-13 14:10:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states and 5129 transitions. [2024-11-13 14:10:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 3078. [2024-11-13 14:10:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 3078 states have (on average 1.666341780376868) internal successors, (5129), 3077 states have internal predecessors, (5129), 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) [2024-11-13 14:10:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 5129 transitions. [2024-11-13 14:10:45,912 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3078 states and 5129 transitions. [2024-11-13 14:10:45,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:10:45,914 INFO L424 stractBuchiCegarLoop]: Abstraction has 3078 states and 5129 transitions. [2024-11-13 14:10:45,914 INFO L331 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-13 14:10:45,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3078 states and 5129 transitions. [2024-11-13 14:10:45,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1138 [2024-11-13 14:10:45,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:45,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:45,934 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] [2024-11-13 14:10:45,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:45,934 INFO L745 eck$LassoCheckResult]: Stem: 24904#$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(11, 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; 24905#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; 24870#L416 assume !(1 == ~c_req_up~0); 24872#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 25076#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 25015#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 25016#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 24953#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 24954#L447-1 assume !(0 == ~e_f~0); 25153#L452-1 assume !(0 == ~e_g~0); 25152#L457-1 assume !(0 == ~e_e~0); 25149#L462-1 assume !(0 == ~e_c~0); 25146#L467-1 assume !(0 == ~e_wl~0); 25145#L472-1 assume !(1 == ~wl_pc~0); 25137#$Ultimate##44 assume !(2 == ~wl_pc~0); 25131#L485 assume !(1 == ~c1_pc~0); 25124#L495 assume !(1 == ~c2_pc~0); 25118#L504 assume !(1 == ~wb_pc~0); 25114#L513 assume !(1 == ~e_c~0); 25111#L522-1 assume !(1 == ~e_e~0); 25107#L527-1 assume !(1 == ~e_f~0); 25105#L532-1 assume !(1 == ~e_g~0); 25036#L537-1 assume !(1 == ~e_c~0); 25037#L542-1 assume !(1 == ~e_wl~0); 26013#L684-1 assume !false; 25936#L554 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; 25723#L389 [2024-11-13 14:10:45,935 INFO L747 eck$LassoCheckResult]: Loop: 25723#L389 assume !false; 27445#L307 assume 0 == ~wl_st~0; 27392#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 27389#L333 assume !(0 != eval_~tmp~0#1); 27444#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 27541#L348 assume !(0 != eval_~tmp___0~0#1); 27539#L344 assume !(0 == ~c2_st~0); 27511#L359 assume !(0 == ~wb_st~0); 27451#L374 assume !(0 == ~r_st~0); 25723#L389 [2024-11-13 14:10:45,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash 823350745, now seen corresponding path program 2 times [2024-11-13 14:10:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:45,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285596348] [2024-11-13 14:10:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:45,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:45,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:45,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:45,965 INFO L85 PathProgramCache]: Analyzing trace with hash -262326369, now seen corresponding path program 1 times [2024-11-13 14:10:45,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:45,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650557842] [2024-11-13 14:10:45,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:45,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:45,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:45,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:45,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:45,974 INFO L85 PathProgramCache]: Analyzing trace with hash -986647353, now seen corresponding path program 1 times [2024-11-13 14:10:45,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:45,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541557368] [2024-11-13 14:10:45,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:45,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:46,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541557368] [2024-11-13 14:10:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541557368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:46,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:46,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:46,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359527603] [2024-11-13 14:10:46,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:46,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:46,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:10:46,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:10:46,072 INFO L87 Difference]: Start difference. First operand 3078 states and 5129 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) [2024-11-13 14:10:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:46,181 INFO L93 Difference]: Finished difference Result 4999 states and 8233 transitions. [2024-11-13 14:10:46,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4999 states and 8233 transitions. [2024-11-13 14:10:46,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1792 [2024-11-13 14:10:46,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4999 states to 4999 states and 8233 transitions. [2024-11-13 14:10:46,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2297 [2024-11-13 14:10:46,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2297 [2024-11-13 14:10:46,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4999 states and 8233 transitions. [2024-11-13 14:10:46,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:46,248 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4999 states and 8233 transitions. [2024-11-13 14:10:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states and 8233 transitions. [2024-11-13 14:10:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4999. [2024-11-13 14:10:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4999 states, 4999 states have (on average 1.6469293858771754) internal successors, (8233), 4998 states have internal predecessors, (8233), 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) [2024-11-13 14:10:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 8233 transitions. [2024-11-13 14:10:46,366 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4999 states and 8233 transitions. [2024-11-13 14:10:46,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:10:46,367 INFO L424 stractBuchiCegarLoop]: Abstraction has 4999 states and 8233 transitions. [2024-11-13 14:10:46,368 INFO L331 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-13 14:10:46,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4999 states and 8233 transitions. [2024-11-13 14:10:46,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1792 [2024-11-13 14:10:46,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:46,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:46,392 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] [2024-11-13 14:10:46,392 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:46,392 INFO L745 eck$LassoCheckResult]: Stem: 32984#$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(11, 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; 32985#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; 32954#L416 assume !(1 == ~c_req_up~0); 32956#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 33165#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 33107#L432-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 33108#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 33038#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 33039#L447-1 assume !(0 == ~e_f~0); 37530#L452-1 assume !(0 == ~e_g~0); 32912#L457-1 assume !(0 == ~e_e~0); 32913#L462-1 assume !(0 == ~e_c~0); 33177#L467-1 assume !(0 == ~e_wl~0); 33148#L472-1 assume !(1 == ~wl_pc~0); 33145#$Ultimate##44 assume !(2 == ~wl_pc~0); 33146#L485 assume !(1 == ~c1_pc~0); 37510#L495 assume !(1 == ~c2_pc~0); 37508#L504 assume !(1 == ~wb_pc~0); 37506#L513 assume !(1 == ~e_c~0); 37505#L522-1 assume !(1 == ~e_e~0); 33157#L527-1 assume !(1 == ~e_f~0); 33158#L532-1 assume !(1 == ~e_g~0); 33130#L537-1 assume !(1 == ~e_c~0); 33131#L542-1 assume !(1 == ~e_wl~0); 37418#L684-1 assume !false; 37419#L554 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; 33975#L389 [2024-11-13 14:10:46,392 INFO L747 eck$LassoCheckResult]: Loop: 33975#L389 assume !false; 36778#L307 assume 0 == ~wl_st~0; 35781#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 35775#L333 assume !(0 != eval_~tmp~0#1); 36774#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 36743#L348 assume !(0 != eval_~tmp___0~0#1); 36773#L344 assume !(0 == ~c2_st~0); 36788#L359 assume !(0 == ~wb_st~0); 36785#L374 assume !(0 == ~r_st~0); 33975#L389 [2024-11-13 14:10:46,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:46,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052571, now seen corresponding path program 1 times [2024-11-13 14:10:46,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:46,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679666558] [2024-11-13 14:10:46,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:46,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679666558] [2024-11-13 14:10:46,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679666558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:46,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:46,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:46,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034938388] [2024-11-13 14:10:46,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:46,433 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 14:10:46,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash -262326369, now seen corresponding path program 2 times [2024-11-13 14:10:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:46,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138216400] [2024-11-13 14:10:46,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:46,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:46,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:46,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:46,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:46,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:10:46,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:10:46,488 INFO L87 Difference]: Start difference. First operand 4999 states and 8233 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) [2024-11-13 14:10:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:46,512 INFO L93 Difference]: Finished difference Result 4899 states and 8051 transitions. [2024-11-13 14:10:46,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4899 states and 8051 transitions. [2024-11-13 14:10:46,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1792 [2024-11-13 14:10:46,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4899 states to 4899 states and 8051 transitions. [2024-11-13 14:10:46,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2198 [2024-11-13 14:10:46,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2198 [2024-11-13 14:10:46,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4899 states and 8051 transitions. [2024-11-13 14:10:46,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:46,577 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4899 states and 8051 transitions. [2024-11-13 14:10:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states and 8051 transitions. [2024-11-13 14:10:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 4899. [2024-11-13 14:10:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4899 states, 4899 states have (on average 1.6433966115533782) internal successors, (8051), 4898 states have internal predecessors, (8051), 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) [2024-11-13 14:10:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4899 states to 4899 states and 8051 transitions. [2024-11-13 14:10:46,729 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4899 states and 8051 transitions. [2024-11-13 14:10:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:10:46,730 INFO L424 stractBuchiCegarLoop]: Abstraction has 4899 states and 8051 transitions. [2024-11-13 14:10:46,730 INFO L331 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-13 14:10:46,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4899 states and 8051 transitions. [2024-11-13 14:10:46,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1792 [2024-11-13 14:10:46,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:46,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:46,750 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] [2024-11-13 14:10:46,750 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:46,750 INFO L745 eck$LassoCheckResult]: Stem: 42890#$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(11, 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; 42891#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; 42857#L416 assume !(1 == ~c_req_up~0); 42859#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 43059#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 43003#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 43004#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 42938#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 42939#L447-1 assume !(0 == ~e_f~0); 43109#L452-1 assume !(0 == ~e_g~0); 43108#L457-1 assume !(0 == ~e_e~0); 43107#L462-1 assume !(0 == ~e_c~0); 43106#L467-1 assume !(0 == ~e_wl~0); 43105#L472-1 assume !(1 == ~wl_pc~0); 43103#$Ultimate##44 assume !(2 == ~wl_pc~0); 43101#L485 assume !(1 == ~c1_pc~0); 43099#L495 assume !(1 == ~c2_pc~0); 43097#L504 assume !(1 == ~wb_pc~0); 43094#L513 assume !(1 == ~e_c~0); 43092#L522-1 assume !(1 == ~e_e~0); 43089#L527-1 assume !(1 == ~e_f~0); 43087#L532-1 assume !(1 == ~e_g~0); 43022#L537-1 assume !(1 == ~e_c~0); 42965#L542-1 assume !(1 == ~e_wl~0); 42966#L684-1 assume !false; 47690#L554 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; 42843#L389 [2024-11-13 14:10:46,750 INFO L747 eck$LassoCheckResult]: Loop: 42843#L389 assume !false; 42844#L307 assume 0 == ~wl_st~0; 43007#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 45325#L333 assume !(0 != eval_~tmp~0#1); 42908#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 42909#L348 assume !(0 != eval_~tmp___0~0#1); 43068#L344 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 47405#L363 assume !(0 != eval_~tmp___1~0#1); 43027#L359 assume !(0 == ~wb_st~0); 42827#L374 assume !(0 == ~r_st~0); 42843#L389 [2024-11-13 14:10:46,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:46,751 INFO L85 PathProgramCache]: Analyzing trace with hash 823350745, now seen corresponding path program 3 times [2024-11-13 14:10:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:46,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482564711] [2024-11-13 14:10:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:46,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:46,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:46,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:46,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash 456197165, now seen corresponding path program 1 times [2024-11-13 14:10:46,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:46,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740079091] [2024-11-13 14:10:46,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:46,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:46,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:46,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:46,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:46,788 INFO L85 PathProgramCache]: Analyzing trace with hash -522916859, now seen corresponding path program 1 times [2024-11-13 14:10:46,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:46,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857593702] [2024-11-13 14:10:46,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:10:46,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:10:46,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857593702] [2024-11-13 14:10:46,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857593702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:46,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:46,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:10:46,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851349604] [2024-11-13 14:10:46,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:46,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:10:46,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:10:46,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:10:46,874 INFO L87 Difference]: Start difference. First operand 4899 states and 8051 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) [2024-11-13 14:10:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:46,943 INFO L93 Difference]: Finished difference Result 8333 states and 13539 transitions. [2024-11-13 14:10:46,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8333 states and 13539 transitions. [2024-11-13 14:10:47,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3082 [2024-11-13 14:10:47,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8333 states to 8333 states and 13539 transitions. [2024-11-13 14:10:47,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3690 [2024-11-13 14:10:47,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3690 [2024-11-13 14:10:47,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8333 states and 13539 transitions. [2024-11-13 14:10:47,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 14:10:47,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8333 states and 13539 transitions. [2024-11-13 14:10:47,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8333 states and 13539 transitions. [2024-11-13 14:10:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8333 to 8333. [2024-11-13 14:10:47,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8333 states, 8333 states have (on average 1.624744989799592) internal successors, (13539), 8332 states have internal predecessors, (13539), 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) [2024-11-13 14:10:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8333 states to 8333 states and 13539 transitions. [2024-11-13 14:10:47,372 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8333 states and 13539 transitions. [2024-11-13 14:10:47,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:10:47,373 INFO L424 stractBuchiCegarLoop]: Abstraction has 8333 states and 13539 transitions. [2024-11-13 14:10:47,373 INFO L331 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-13 14:10:47,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8333 states and 13539 transitions. [2024-11-13 14:10:47,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3082 [2024-11-13 14:10:47,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:10:47,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:10:47,415 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] [2024-11-13 14:10:47,415 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:47,415 INFO L745 eck$LassoCheckResult]: Stem: 56132#$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(11, 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; 56133#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; 56098#L416 assume !(1 == ~c_req_up~0); 56100#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 56316#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 56248#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 56249#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 56179#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 56180#L447-1 assume !(0 == ~e_f~0); 56374#L452-1 assume !(0 == ~e_g~0); 56373#L457-1 assume !(0 == ~e_e~0); 56372#L462-1 assume !(0 == ~e_c~0); 56371#L467-1 assume !(0 == ~e_wl~0); 56370#L472-1 assume !(1 == ~wl_pc~0); 56368#$Ultimate##44 assume !(2 == ~wl_pc~0); 56366#L485 assume !(1 == ~c1_pc~0); 56364#L495 assume !(1 == ~c2_pc~0); 56362#L504 assume !(1 == ~wb_pc~0); 56359#L513 assume !(1 == ~e_c~0); 56357#L522-1 assume !(1 == ~e_e~0); 56354#L527-1 assume !(1 == ~e_f~0); 56352#L532-1 assume !(1 == ~e_g~0); 56272#L537-1 assume !(1 == ~e_c~0); 56205#L542-1 assume !(1 == ~e_wl~0); 56206#L684-1 assume !false; 63008#L554 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; 58127#L389 [2024-11-13 14:10:47,415 INFO L747 eck$LassoCheckResult]: Loop: 58127#L389 assume !false; 64251#L307 assume 0 == ~wl_st~0; 59263#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 59261#L333 assume !(0 != eval_~tmp~0#1); 59262#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 60134#L348 assume !(0 != eval_~tmp___0~0#1); 59891#L344 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 59888#L363 assume !(0 != eval_~tmp___1~0#1); 59886#L359 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 59858#L378 assume !(0 != eval_~tmp___2~0#1); 59884#L374 assume !(0 == ~r_st~0); 58127#L389 [2024-11-13 14:10:47,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:47,416 INFO L85 PathProgramCache]: Analyzing trace with hash 823350745, now seen corresponding path program 4 times [2024-11-13 14:10:47,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:47,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199009387] [2024-11-13 14:10:47,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:47,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:47,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:47,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:47,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:47,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1257175796, now seen corresponding path program 1 times [2024-11-13 14:10:47,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:47,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763849813] [2024-11-13 14:10:47,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:47,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:47,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:47,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:47,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:47,461 INFO L85 PathProgramCache]: Analyzing trace with hash 969412124, now seen corresponding path program 1 times [2024-11-13 14:10:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:47,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386190083] [2024-11-13 14:10:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:47,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:47,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:47,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:10:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:49,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:10:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:10:49,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 02:10:49 BoogieIcfgContainer [2024-11-13 14:10:49,220 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-13 14:10:49,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:10:49,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:10:49,221 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:10:49,225 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:10:35" (3/4) ... [2024-11-13 14:10:49,228 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-13 14:10:49,327 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:10:49,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:10:49,328 INFO L158 Benchmark]: Toolchain (without parser) took 15064.46ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 91.3MB in the beginning and 129.8MB in the end (delta: -38.5MB). Peak memory consumption was 154.2MB. Max. memory is 16.1GB. [2024-11-13 14:10:49,330 INFO L158 Benchmark]: CDTParser took 1.40ms. Allocated memory is still 83.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:10:49,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.77ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 76.5MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:10:49,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.55ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 74.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:10:49,331 INFO L158 Benchmark]: Boogie Preprocessor took 80.73ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 72.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:10:49,332 INFO L158 Benchmark]: RCFGBuilder took 1027.17ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 46.8MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:10:49,333 INFO L158 Benchmark]: BuchiAutomizer took 13319.46ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 46.8MB in the beginning and 135.8MB in the end (delta: -89.1MB). Peak memory consumption was 103.8MB. Max. memory is 16.1GB. [2024-11-13 14:10:49,333 INFO L158 Benchmark]: Witness Printer took 106.16ms. Allocated memory is still 310.4MB. Free memory was 135.8MB in the beginning and 129.8MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:10:49,338 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40ms. Allocated memory is still 83.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.77ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 76.5MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.55ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 74.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.73ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 72.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1027.17ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 46.8MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 13319.46ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 46.8MB in the beginning and 135.8MB in the end (delta: -89.1MB). Peak memory consumption was 103.8MB. Max. memory is 16.1GB. * Witness Printer took 106.16ms. Allocated memory is still 310.4MB. Free memory was 135.8MB in the beginning and 129.8MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. 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 (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -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 8333 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.0s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 8.7s. Construction of modules took 0.5s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1683 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.5s 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, 3554 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3551 mSDsluCounter, 6493 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2405 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 4088 mSDtfsCounter, 280 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN3 SILU0 SILI3 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital76 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf147 smp91 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 306]: 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] [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] 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, 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] [L416] 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, 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] [L427] COND TRUE (int )wl_i == 1 [L428] 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, 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] [L432] COND TRUE (int )c1_i == 1 [L433] 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, 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] [L437] COND TRUE (int )c2_i == 1 [L438] 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, 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] [L442] COND TRUE (int )wb_i == 1 [L443] 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, 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] [L447] COND FALSE !((int )r_i == 1) [L450] 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, 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] [L452] 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, 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] [L457] 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, 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] [L462] 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, 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] [L467] 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, 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] [L472] 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, 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 == 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, 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] [L485] 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, 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] [L495] 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, 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] [L504] 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, 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] [L513] 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, 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] [L522] 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, 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] [L527] 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, 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] [L532] 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, 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] [L537] 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, 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] [L542] 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, 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] [L547] 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, 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] [L553] 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, 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] [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] 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: [L306] COND TRUE 1 [L308] COND TRUE (int )wl_st == 0 [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND FALSE !(\read(tmp)) [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND FALSE !(\read(tmp___0)) [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp___1)) [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp___2)) [L389] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 306]: 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] [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] 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, 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] [L416] 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, 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] [L427] COND TRUE (int )wl_i == 1 [L428] 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, 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] [L432] COND TRUE (int )c1_i == 1 [L433] 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, 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] [L437] COND TRUE (int )c2_i == 1 [L438] 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, 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] [L442] COND TRUE (int )wb_i == 1 [L443] 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, 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] [L447] COND FALSE !((int )r_i == 1) [L450] 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, 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] [L452] 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, 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] [L457] 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, 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] [L462] 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, 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] [L467] 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, 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] [L472] 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, 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 == 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, 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] [L485] 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, 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] [L495] 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, 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] [L504] 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, 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] [L513] 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, 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] [L522] 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, 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] [L527] 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, 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] [L532] 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, 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] [L537] 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, 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] [L542] 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, 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] [L547] 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, 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] [L553] 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, 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] [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] 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: [L306] COND TRUE 1 [L308] COND TRUE (int )wl_st == 0 [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND FALSE !(\read(tmp)) [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND FALSE !(\read(tmp___0)) [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp___1)) [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp___2)) [L389] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 14:10:49,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be51432-6703-4bbd-ae6c-07b189834379/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)