./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_6.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_b12a2737-08ec-45ea-bd6e-29f040165682/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/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_b12a2737-08ec-45ea-bd6e-29f040165682/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_6.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/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_b12a2737-08ec-45ea-bd6e-29f040165682/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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:03:49,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:03:49,879 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 14:03:49,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:03:49,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:03:49,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:03:49,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:03:49,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:03:49,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:03:49,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:03:49,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:03:49,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:03:49,940 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:03:49,941 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 14:03:49,941 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 14:03:49,941 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 14:03:49,941 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 14:03:49,941 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 14:03:49,941 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 14:03:49,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:03:49,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 14:03:49,942 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:03:49,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:03:49,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:03:49,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:03:49,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 14:03:49,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 14:03:49,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 14:03:49,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:03:49,943 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:03:49,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:03:49,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:03:49,943 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 14:03:49,944 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:03:49,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:03:49,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:03:49,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:03:49,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:03:49,945 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 14:03:49,945 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_b12a2737-08ec-45ea-bd6e-29f040165682/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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2024-11-13 14:03:50,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:03:50,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:03:50,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:03:50,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:03:50,311 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:03:50,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/locks/test_locks_6.c Unable to find full path for "g++" [2024-11-13 14:03:52,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:03:53,008 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:03:53,009 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/sv-benchmarks/c/locks/test_locks_6.c [2024-11-13 14:03:53,031 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/bin/uautomizer-verify-qhAvR1uOyd/data/8cdca8b6a/b410b5ce7360422db69f7ea1bc9bb5df/FLAG2fd7f7867 [2024-11-13 14:03:53,220 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/bin/uautomizer-verify-qhAvR1uOyd/data/8cdca8b6a/b410b5ce7360422db69f7ea1bc9bb5df [2024-11-13 14:03:53,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:03:53,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:03:53,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:03:53,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:03:53,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:03:53,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3811964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53, skipping insertion in model container [2024-11-13 14:03:53,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:03:53,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:03:53,546 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:03:53,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:03:53,606 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:03:53,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53 WrapperNode [2024-11-13 14:03:53,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:03:53,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:03:53,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:03:53,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:03:53,619 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:03:53" (1/1) ... [2024-11-13 14:03:53,628 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:03:53" (1/1) ... [2024-11-13 14:03:53,656 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2024-11-13 14:03:53,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:03:53,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:03:53,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:03:53,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:03:53,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,697 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:03:53,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:03:53,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:03:53,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:03:53,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:03:53,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:03:53,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:03:53,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/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:03:53,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/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:03:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:03:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:03:53,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:03:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:03:53,906 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:03:53,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:03:54,187 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-13 14:03:54,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:03:54,204 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:03:54,204 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:03:54,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:03:54 BoogieIcfgContainer [2024-11-13 14:03:54,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:03:54,206 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 14:03:54,207 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 14:03:54,218 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 14:03:54,219 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 14:03:54,219 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 02:03:53" (1/3) ... [2024-11-13 14:03:54,221 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54e0cca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 02:03:54, skipping insertion in model container [2024-11-13 14:03:54,222 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 14:03:54,222 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (2/3) ... [2024-11-13 14:03:54,222 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54e0cca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 02:03:54, skipping insertion in model container [2024-11-13 14:03:54,222 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 14:03:54,222 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:03:54" (3/3) ... [2024-11-13 14:03:54,224 INFO L333 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2024-11-13 14:03:54,310 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 14:03:54,311 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 14:03:54,312 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 14:03:54,312 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 14:03:54,312 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 14:03:54,312 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 14:03:54,313 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 14:03:54,314 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 14:03:54,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 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:03:54,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-13 14:03:54,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:03:54,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:03:54,358 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:03:54,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:54,359 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 14:03:54,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 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:03:54,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-13 14:03:54,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:03:54,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:03:54,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:03:54,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:54,380 INFO L745 eck$LassoCheckResult]: Stem: 26#$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(15, 2);call #Ultimate.allocInit(12, 3); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 10#L99-1true [2024-11-13 14:03:54,381 INFO L747 eck$LassoCheckResult]: Loop: 10#L99-1true assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 6#L31true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 14#L48true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L48-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 28#L52-1true assume !(0 != main_~p3~0#1); 18#L56-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 5#L60-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 23#L64-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 21#L68-1true assume !(0 != main_~p1~0#1); 27#L74-1true assume !(0 != main_~p2~0#1); 12#L79-1true assume !(0 != main_~p3~0#1); 20#L84-1true assume !(0 != main_~p4~0#1); 13#L89-1true assume !(0 != main_~p5~0#1); 9#L94-1true assume !(0 != main_~p6~0#1); 10#L99-1true [2024-11-13 14:03:54,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-13 14:03:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:54,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762580540] [2024-11-13 14:03:54,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:54,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:54,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:03:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:54,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:03:54,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1799400087, now seen corresponding path program 1 times [2024-11-13 14:03:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:54,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709846183] [2024-11-13 14:03:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:54,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:54,729 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:03:54,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709846183] [2024-11-13 14:03:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709846183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:54,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:54,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:03:54,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551408769] [2024-11-13 14:03:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:54,737 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:03:54,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:54,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:03:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:03:54,786 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 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 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:03:54,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:54,853 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2024-11-13 14:03:54,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 81 transitions. [2024-11-13 14:03:54,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2024-11-13 14:03:54,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 63 transitions. [2024-11-13 14:03:54,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-11-13 14:03:54,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-13 14:03:54,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2024-11-13 14:03:54,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:03:54,880 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 63 transitions. [2024-11-13 14:03:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2024-11-13 14:03:54,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-13 14:03:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:03:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2024-11-13 14:03:54,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 63 transitions. [2024-11-13 14:03:54,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:03:54,933 INFO L424 stractBuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2024-11-13 14:03:54,933 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 14:03:54,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2024-11-13 14:03:54,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2024-11-13 14:03:54,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:03:54,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:03:54,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:03:54,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:54,940 INFO L745 eck$LassoCheckResult]: Stem: 108#$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(15, 2);call #Ultimate.allocInit(12, 3); 101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 100#L99-1 [2024-11-13 14:03:54,941 INFO L747 eck$LassoCheckResult]: Loop: 100#L99-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 107#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 116#L48 assume !(0 != main_~p1~0#1); 86#L48-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 87#L52-1 assume !(0 != main_~p3~0#1); 115#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 114#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 113#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 112#L68-1 assume !(0 != main_~p1~0#1); 109#L74-1 assume !(0 != main_~p2~0#1); 105#L79-1 assume !(0 != main_~p3~0#1); 89#L84-1 assume !(0 != main_~p4~0#1); 93#L89-1 assume !(0 != main_~p5~0#1); 91#L94-1 assume !(0 != main_~p6~0#1); 100#L99-1 [2024-11-13 14:03:54,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:54,942 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-13 14:03:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:54,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078302995] [2024-11-13 14:03:54,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:54,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:03:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:54,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:03:54,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:54,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2057565525, now seen corresponding path program 1 times [2024-11-13 14:03:54,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:54,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009242910] [2024-11-13 14:03:54,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:54,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:55,037 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:03:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:55,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009242910] [2024-11-13 14:03:55,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009242910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:55,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:55,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:03:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8704105] [2024-11-13 14:03:55,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:55,038 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:03:55,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:55,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:03:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:03:55,039 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:03:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:55,062 INFO L93 Difference]: Finished difference Result 78 states and 118 transitions. [2024-11-13 14:03:55,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 118 transitions. [2024-11-13 14:03:55,065 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2024-11-13 14:03:55,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 118 transitions. [2024-11-13 14:03:55,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2024-11-13 14:03:55,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2024-11-13 14:03:55,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 118 transitions. [2024-11-13 14:03:55,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:03:55,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-13 14:03:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 118 transitions. [2024-11-13 14:03:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-13 14:03:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 77 states have internal predecessors, (118), 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:03:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-13 14:03:55,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-13 14:03:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:03:55,077 INFO L424 stractBuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-13 14:03:55,078 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 14:03:55,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 118 transitions. [2024-11-13 14:03:55,079 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2024-11-13 14:03:55,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:03:55,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:03:55,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:03:55,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:55,081 INFO L745 eck$LassoCheckResult]: Stem: 235#$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(15, 2);call #Ultimate.allocInit(12, 3); 224#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 225#L99-1 [2024-11-13 14:03:55,081 INFO L747 eck$LassoCheckResult]: Loop: 225#L99-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 262#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 259#L48 assume !(0 != main_~p1~0#1); 258#L48-2 assume !(0 != main_~p2~0#1); 237#L52-1 assume !(0 != main_~p3~0#1); 238#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 254#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 253#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 252#L68-1 assume !(0 != main_~p1~0#1); 239#L74-1 assume !(0 != main_~p2~0#1); 241#L79-1 assume !(0 != main_~p3~0#1); 287#L84-1 assume !(0 != main_~p4~0#1); 285#L89-1 assume !(0 != main_~p5~0#1); 269#L94-1 assume !(0 != main_~p6~0#1); 225#L99-1 [2024-11-13 14:03:55,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-13 14:03:55,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:55,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225162097] [2024-11-13 14:03:55,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:55,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:03:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:03:55,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:55,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1536337193, now seen corresponding path program 1 times [2024-11-13 14:03:55,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:55,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664763782] [2024-11-13 14:03:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:55,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:55,146 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:03:55,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:55,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664763782] [2024-11-13 14:03:55,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664763782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:55,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:55,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:03:55,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521258223] [2024-11-13 14:03:55,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:55,147 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:03:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:55,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:03:55,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:03:55,148 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:03:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:55,175 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2024-11-13 14:03:55,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 222 transitions. [2024-11-13 14:03:55,179 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2024-11-13 14:03:55,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 222 transitions. [2024-11-13 14:03:55,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2024-11-13 14:03:55,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2024-11-13 14:03:55,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 222 transitions. [2024-11-13 14:03:55,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:03:55,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 222 transitions. [2024-11-13 14:03:55,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 222 transitions. [2024-11-13 14:03:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-13 14:03:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.48) internal successors, (222), 149 states have internal predecessors, (222), 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:03:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2024-11-13 14:03:55,198 INFO L240 hiAutomatonCegarLoop]: Abstraction has 150 states and 222 transitions. [2024-11-13 14:03:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:03:55,200 INFO L424 stractBuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2024-11-13 14:03:55,200 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 14:03:55,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 222 transitions. [2024-11-13 14:03:55,203 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2024-11-13 14:03:55,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:03:55,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:03:55,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:03:55,204 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:55,204 INFO L745 eck$LassoCheckResult]: Stem: 468#$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(15, 2);call #Ultimate.allocInit(12, 3); 458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 459#L99-1 [2024-11-13 14:03:55,205 INFO L747 eck$LassoCheckResult]: Loop: 459#L99-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 500#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 495#L48 assume !(0 != main_~p1~0#1); 490#L48-2 assume !(0 != main_~p2~0#1); 483#L52-1 assume !(0 != main_~p3~0#1); 484#L56-1 assume !(0 != main_~p4~0#1); 543#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 542#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 536#L68-1 assume !(0 != main_~p1~0#1); 538#L74-1 assume !(0 != main_~p2~0#1); 535#L79-1 assume !(0 != main_~p3~0#1); 533#L84-1 assume !(0 != main_~p4~0#1); 532#L89-1 assume !(0 != main_~p5~0#1); 514#L94-1 assume !(0 != main_~p6~0#1); 459#L99-1 [2024-11-13 14:03:55,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-13 14:03:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:55,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858116555] [2024-11-13 14:03:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:03:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:03:55,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:55,229 INFO L85 PathProgramCache]: Analyzing trace with hash -856278823, now seen corresponding path program 1 times [2024-11-13 14:03:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:55,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263317990] [2024-11-13 14:03:55,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:55,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:55,334 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:03:55,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:55,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263317990] [2024-11-13 14:03:55,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263317990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:55,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:55,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:03:55,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813150869] [2024-11-13 14:03:55,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:55,336 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:03:55,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:55,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:03:55,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:03:55,337 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:03:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:55,376 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2024-11-13 14:03:55,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 418 transitions. [2024-11-13 14:03:55,385 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2024-11-13 14:03:55,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 418 transitions. [2024-11-13 14:03:55,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2024-11-13 14:03:55,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2024-11-13 14:03:55,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 418 transitions. [2024-11-13 14:03:55,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:03:55,393 INFO L218 hiAutomatonCegarLoop]: Abstraction has 290 states and 418 transitions. [2024-11-13 14:03:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 418 transitions. [2024-11-13 14:03:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2024-11-13 14:03:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 290 states have (on average 1.4413793103448276) internal successors, (418), 289 states have internal predecessors, (418), 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:03:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 418 transitions. [2024-11-13 14:03:55,432 INFO L240 hiAutomatonCegarLoop]: Abstraction has 290 states and 418 transitions. [2024-11-13 14:03:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:03:55,440 INFO L424 stractBuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2024-11-13 14:03:55,440 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 14:03:55,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 418 transitions. [2024-11-13 14:03:55,451 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2024-11-13 14:03:55,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:03:55,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:03:55,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:03:55,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:55,452 INFO L745 eck$LassoCheckResult]: Stem: 918#$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(15, 2);call #Ultimate.allocInit(12, 3); 905#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 906#L99-1 [2024-11-13 14:03:55,452 INFO L747 eck$LassoCheckResult]: Loop: 906#L99-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 960#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 958#L48 assume !(0 != main_~p1~0#1); 954#L48-2 assume !(0 != main_~p2~0#1); 952#L52-1 assume !(0 != main_~p3~0#1); 948#L56-1 assume !(0 != main_~p4~0#1); 944#L60-1 assume !(0 != main_~p5~0#1); 942#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 939#L68-1 assume !(0 != main_~p1~0#1); 940#L74-1 assume !(0 != main_~p2~0#1); 976#L79-1 assume !(0 != main_~p3~0#1); 971#L84-1 assume !(0 != main_~p4~0#1); 967#L89-1 assume !(0 != main_~p5~0#1); 964#L94-1 assume !(0 != main_~p6~0#1); 906#L99-1 [2024-11-13 14:03:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-13 14:03:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165903020] [2024-11-13 14:03:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:03:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:03:55,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1665625449, now seen corresponding path program 1 times [2024-11-13 14:03:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:55,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23282626] [2024-11-13 14:03:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:55,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:55,532 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:03:55,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:55,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23282626] [2024-11-13 14:03:55,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23282626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:55,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:55,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:03:55,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052760353] [2024-11-13 14:03:55,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:55,535 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:03:55,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:55,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:03:55,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:03:55,537 INFO L87 Difference]: Start difference. First operand 290 states and 418 transitions. cyclomatic complexity: 144 Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:03:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:55,573 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2024-11-13 14:03:55,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 786 transitions. [2024-11-13 14:03:55,582 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2024-11-13 14:03:55,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 786 transitions. [2024-11-13 14:03:55,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2024-11-13 14:03:55,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2024-11-13 14:03:55,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 786 transitions. [2024-11-13 14:03:55,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:03:55,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 562 states and 786 transitions. [2024-11-13 14:03:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 786 transitions. [2024-11-13 14:03:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2024-11-13 14:03:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 562 states have (on average 1.398576512455516) internal successors, (786), 561 states have internal predecessors, (786), 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:03:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2024-11-13 14:03:55,660 INFO L240 hiAutomatonCegarLoop]: Abstraction has 562 states and 786 transitions. [2024-11-13 14:03:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:03:55,662 INFO L424 stractBuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2024-11-13 14:03:55,666 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 14:03:55,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 786 transitions. [2024-11-13 14:03:55,671 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2024-11-13 14:03:55,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:03:55,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:03:55,676 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:03:55,676 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:55,676 INFO L745 eck$LassoCheckResult]: Stem: 1774#$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(15, 2);call #Ultimate.allocInit(12, 3); 1763#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 1764#L99-1 [2024-11-13 14:03:55,680 INFO L747 eck$LassoCheckResult]: Loop: 1764#L99-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 1830#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 1828#L48 assume !(0 != main_~p1~0#1); 1824#L48-2 assume !(0 != main_~p2~0#1); 1822#L52-1 assume !(0 != main_~p3~0#1); 1818#L56-1 assume !(0 != main_~p4~0#1); 1814#L60-1 assume !(0 != main_~p5~0#1); 1810#L64-1 assume !(0 != main_~p6~0#1); 1807#L68-1 assume !(0 != main_~p1~0#1); 1808#L74-1 assume !(0 != main_~p2~0#1); 1846#L79-1 assume !(0 != main_~p3~0#1); 1841#L84-1 assume !(0 != main_~p4~0#1); 1837#L89-1 assume !(0 != main_~p5~0#1); 1833#L94-1 assume !(0 != main_~p6~0#1); 1764#L99-1 [2024-11-13 14:03:55,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-13 14:03:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:55,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197691530] [2024-11-13 14:03:55,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:03:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:03:55,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:55,716 INFO L85 PathProgramCache]: Analyzing trace with hash 109381913, now seen corresponding path program 1 times [2024-11-13 14:03:55,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:55,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557063747] [2024-11-13 14:03:55,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:55,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:03:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:03:55,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1324723877, now seen corresponding path program 1 times [2024-11-13 14:03:55,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:55,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776070631] [2024-11-13 14:03:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:55,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:03:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:55,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:03:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:56,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:03:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:56,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 02:03:56 BoogieIcfgContainer [2024-11-13 14:03:56,398 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-13 14:03:56,399 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:03:56,400 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:03:56,400 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:03:56,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:03:54" (3/4) ... [2024-11-13 14:03:56,404 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-13 14:03:56,455 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:03:56,455 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:03:56,457 INFO L158 Benchmark]: Toolchain (without parser) took 3229.54ms. Allocated memory is still 117.4MB. Free memory was 94.8MB in the beginning and 46.2MB in the end (delta: 48.6MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-11-13 14:03:56,457 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 167.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:03:56,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.81ms. Allocated memory is still 117.4MB. Free memory was 94.8MB in the beginning and 83.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:03:56,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.42ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 82.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:03:56,462 INFO L158 Benchmark]: Boogie Preprocessor took 63.41ms. Allocated memory is still 117.4MB. Free memory was 82.5MB in the beginning and 81.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:03:56,462 INFO L158 Benchmark]: RCFGBuilder took 482.68ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 69.8MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:03:56,462 INFO L158 Benchmark]: BuchiAutomizer took 2192.56ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 48.7MB in the end (delta: 21.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-13 14:03:56,463 INFO L158 Benchmark]: Witness Printer took 56.18ms. Allocated memory is still 117.4MB. Free memory was 48.2MB in the beginning and 46.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:03:56,467 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54ms. Allocated memory is still 167.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.81ms. Allocated memory is still 117.4MB. Free memory was 94.8MB in the beginning and 83.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.42ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 82.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.41ms. Allocated memory is still 117.4MB. Free memory was 82.5MB in the beginning and 81.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 482.68ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 69.8MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2192.56ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 48.7MB in the end (delta: 21.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Witness Printer took 56.18ms. Allocated memory is still 117.4MB. Free memory was 48.2MB in the beginning and 46.2MB in the end (delta: 2.0MB). There was no memory consumed. 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 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 562 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 403 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 255 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 29]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 14:03:56,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12a2737-08ec-45ea-bd6e-29f040165682/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)