./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14-2.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_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/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_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/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_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:40:39,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:40:39,152 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 14:40:39,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:40:39,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:40:39,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:40:39,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:40:39,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:40:39,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:40:39,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:40:39,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:40:39,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:40:39,193 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:40:39,194 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 14:40:39,194 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 14:40:39,194 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 14:40:39,194 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 14:40:39,195 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 14:40:39,195 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 14:40:39,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:40:39,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 14:40:39,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:40:39,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:40:39,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:40:39,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:40:39,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 14:40:39,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 14:40:39,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 14:40:39,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:40:39,197 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:40:39,197 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:40:39,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:40:39,197 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 14:40:39,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:40:39,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:40:39,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:40:39,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:40:39,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:40:39,198 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 14:40:39,199 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_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2024-11-13 14:40:39,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:40:39,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:40:39,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:40:39,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:40:39,575 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:40:39,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/locks/test_locks_14-2.c Unable to find full path for "g++" [2024-11-13 14:40:41,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:40:41,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:40:41,828 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/sv-benchmarks/c/locks/test_locks_14-2.c [2024-11-13 14:40:41,837 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/bin/uautomizer-verify-qhAvR1uOyd/data/deb69db3e/2c3a79d883fa4431a69b364e43668031/FLAG0510e57d4 [2024-11-13 14:40:41,853 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/bin/uautomizer-verify-qhAvR1uOyd/data/deb69db3e/2c3a79d883fa4431a69b364e43668031 [2024-11-13 14:40:41,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:40:41,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:40:41,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:40:41,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:40:41,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:40:41,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:40:41" (1/1) ... [2024-11-13 14:40:41,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62982ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:41, skipping insertion in model container [2024-11-13 14:40:41,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:40:41" (1/1) ... [2024-11-13 14:40:41,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:40:42,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:40:42,096 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:40:42,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:40:42,137 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:40:42,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42 WrapperNode [2024-11-13 14:40:42,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:40:42,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:40:42,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:40:42,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:40:42,146 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:40:42" (1/1) ... [2024-11-13 14:40:42,153 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:40:42" (1/1) ... [2024-11-13 14:40:42,174 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 183 [2024-11-13 14:40:42,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:40:42,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:40:42,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:40:42,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:40:42,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42" (1/1) ... [2024-11-13 14:40:42,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42" (1/1) ... [2024-11-13 14:40:42,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42" (1/1) ... [2024-11-13 14:40:42,212 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:40:42,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42" (1/1) ... [2024-11-13 14:40:42,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42" (1/1) ... [2024-11-13 14:40:42,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42" (1/1) ... [2024-11-13 14:40:42,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42" (1/1) ... [2024-11-13 14:40:42,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42" (1/1) ... [2024-11-13 14:40:42,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42" (1/1) ... [2024-11-13 14:40:42,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:40:42,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:40:42,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:40:42,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:40:42,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42" (1/1) ... [2024-11-13 14:40:42,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 14:40:42,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:40:42,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/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:40:42,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/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:40:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:40:42,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:40:42,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:40:42,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:40:42,408 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:40:42,410 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:40:42,731 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-13 14:40:42,731 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:40:42,743 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:40:42,743 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:40:42,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:40:42 BoogieIcfgContainer [2024-11-13 14:40:42,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:40:42,747 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 14:40:42,747 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 14:40:42,752 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 14:40:42,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 14:40:42,754 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 02:40:41" (1/3) ... [2024-11-13 14:40:42,755 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@697f71a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 02:40:42, skipping insertion in model container [2024-11-13 14:40:42,755 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 14:40:42,756 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:40:42" (2/3) ... [2024-11-13 14:40:42,756 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@697f71a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 02:40:42, skipping insertion in model container [2024-11-13 14:40:42,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 14:40:42,756 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:40:42" (3/3) ... [2024-11-13 14:40:42,761 INFO L333 chiAutomizerObserver]: Analyzing ICFG test_locks_14-2.c [2024-11-13 14:40:42,828 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 14:40:42,829 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 14:40:42,830 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 14:40:42,830 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 14:40:42,830 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 14:40:42,830 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 14:40:42,831 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 14:40:42,832 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 14:40:42,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 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:40:42,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2024-11-13 14:40:42,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:42,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:42,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:42,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:42,872 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 14:40:42,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 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:40:42,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2024-11-13 14:40:42,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:42,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:42,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:42,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:42,891 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(18, 2);call #Ultimate.allocInit(12, 3); 35#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~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_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 32#L211true [2024-11-13 14:40:42,893 INFO L747 eck$LassoCheckResult]: Loop: 32#L211true assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 46#L55true 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;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 22#L88true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 11#L88-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 33#L92-1true assume !(0 != main_~p3~0#1); 3#L96-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L100-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 49#L104-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L108-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 52#L112-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 27#L116-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 39#L120-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 34#L124-1true assume !(0 != main_~p11~0#1); 16#L128-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 48#L132-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 42#L136-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 38#L140-1true assume !(0 != main_~p1~0#1); 17#L146-1true assume 0 != main_~p2~0#1; 28#L152true assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 13#L151true assume !(0 != main_~p3~0#1); 29#L156-1true assume !(0 != main_~p4~0#1); 4#L161-1true assume !(0 != main_~p5~0#1); 10#L166-1true assume !(0 != main_~p6~0#1); 24#L171-1true assume !(0 != main_~p7~0#1); 20#L176-1true assume !(0 != main_~p8~0#1); 50#L181-1true assume !(0 != main_~p9~0#1); 21#L186-1true assume !(0 != main_~p10~0#1); 37#L191-1true assume !(0 != main_~p11~0#1); 51#L196-1true assume !(0 != main_~p12~0#1); 25#L201-1true assume !(0 != main_~p13~0#1); 14#L206-1true assume 0 != main_~p14~0#1; 8#L212true assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 32#L211true [2024-11-13 14:40:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-13 14:40:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:42,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67192989] [2024-11-13 14:40:42,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:42,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:43,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:43,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:43,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:43,047 INFO L85 PathProgramCache]: Analyzing trace with hash -878582343, now seen corresponding path program 1 times [2024-11-13 14:40:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:43,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610486865] [2024-11-13 14:40:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:43,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:43,205 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:40:43,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:40:43,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610486865] [2024-11-13 14:40:43,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610486865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:40:43,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:40:43,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:40:43,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272851745] [2024-11-13 14:40:43,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:40:43,211 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:40:43,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:40:43,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:40:43,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:40:43,248 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 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 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:40:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:43,298 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2024-11-13 14:40:43,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 177 transitions. [2024-11-13 14:40:43,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2024-11-13 14:40:43,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 89 states and 139 transitions. [2024-11-13 14:40:43,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2024-11-13 14:40:43,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2024-11-13 14:40:43,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 139 transitions. [2024-11-13 14:40:43,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:40:43,322 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 139 transitions. [2024-11-13 14:40:43,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 139 transitions. [2024-11-13 14:40:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-13 14:40:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.5617977528089888) internal successors, (139), 88 states have internal predecessors, (139), 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:40:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2024-11-13 14:40:43,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 139 transitions. [2024-11-13 14:40:43,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:40:43,363 INFO L424 stractBuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2024-11-13 14:40:43,364 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 14:40:43,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 139 transitions. [2024-11-13 14:40:43,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2024-11-13 14:40:43,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:43,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:43,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:43,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:43,367 INFO L745 eck$LassoCheckResult]: Stem: 208#$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(18, 2);call #Ultimate.allocInit(12, 3); 174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~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_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 175#L211 [2024-11-13 14:40:43,367 INFO L747 eck$LassoCheckResult]: Loop: 175#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 202#L55 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;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 203#L88 assume !(0 != main_~p1~0#1); 184#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 162#L92-1 assume !(0 != main_~p3~0#1); 160#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 161#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 169#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 185#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 186#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 209#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 183#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 172#L124-1 assume !(0 != main_~p11~0#1); 173#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 193#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 219#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 217#L140-1 assume !(0 != main_~p1~0#1); 218#L146-1 assume 0 != main_~p2~0#1; 246#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 245#L151 assume !(0 != main_~p3~0#1); 210#L156-1 assume !(0 != main_~p4~0#1); 163#L161-1 assume !(0 != main_~p5~0#1); 165#L166-1 assume !(0 != main_~p6~0#1); 179#L171-1 assume !(0 != main_~p7~0#1); 198#L176-1 assume !(0 != main_~p8~0#1); 200#L181-1 assume !(0 != main_~p9~0#1); 195#L186-1 assume !(0 != main_~p10~0#1); 180#L191-1 assume !(0 != main_~p11~0#1); 177#L196-1 assume !(0 != main_~p12~0#1); 206#L201-1 assume !(0 != main_~p13~0#1); 167#L206-1 assume 0 != main_~p14~0#1; 226#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 175#L211 [2024-11-13 14:40:43,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:43,368 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-13 14:40:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:43,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029988067] [2024-11-13 14:40:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:43,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:43,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:43,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:43,390 INFO L85 PathProgramCache]: Analyzing trace with hash -855950089, now seen corresponding path program 1 times [2024-11-13 14:40:43,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:43,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284834188] [2024-11-13 14:40:43,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:43,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:43,519 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:40:43,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:40:43,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284834188] [2024-11-13 14:40:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284834188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:40:43,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:40:43,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:40:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252533939] [2024-11-13 14:40:43,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:40:43,520 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:40:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:40:43,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:40:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:40:43,521 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:40:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:43,548 INFO L93 Difference]: Finished difference Result 174 states and 270 transitions. [2024-11-13 14:40:43,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 270 transitions. [2024-11-13 14:40:43,551 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2024-11-13 14:40:43,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 270 transitions. [2024-11-13 14:40:43,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2024-11-13 14:40:43,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2024-11-13 14:40:43,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 270 transitions. [2024-11-13 14:40:43,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:40:43,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 270 transitions. [2024-11-13 14:40:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 270 transitions. [2024-11-13 14:40:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-13 14:40:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5517241379310345) internal successors, (270), 173 states have internal predecessors, (270), 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:40:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 270 transitions. [2024-11-13 14:40:43,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 270 transitions. [2024-11-13 14:40:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:40:43,570 INFO L424 stractBuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2024-11-13 14:40:43,570 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 14:40:43,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 270 transitions. [2024-11-13 14:40:43,572 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2024-11-13 14:40:43,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:43,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:43,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:43,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:43,573 INFO L745 eck$LassoCheckResult]: Stem: 479#$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(18, 2);call #Ultimate.allocInit(12, 3); 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~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_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 444#L211 [2024-11-13 14:40:43,574 INFO L747 eck$LassoCheckResult]: Loop: 444#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 509#L55 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;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 508#L88 assume !(0 != main_~p1~0#1); 507#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 506#L92-1 assume !(0 != main_~p3~0#1); 504#L96-1 assume !(0 != main_~p4~0#1); 505#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 481#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 482#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 486#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 487#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 495#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 496#L124-1 assume !(0 != main_~p11~0#1); 464#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 465#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 489#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 490#L140-1 assume !(0 != main_~p1~0#1); 539#L146-1 assume 0 != main_~p2~0#1; 537#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 534#L151 assume !(0 != main_~p3~0#1); 531#L156-1 assume !(0 != main_~p4~0#1); 529#L161-1 assume !(0 != main_~p5~0#1); 527#L166-1 assume !(0 != main_~p6~0#1); 525#L171-1 assume !(0 != main_~p7~0#1); 523#L176-1 assume !(0 != main_~p8~0#1); 521#L181-1 assume !(0 != main_~p9~0#1); 518#L186-1 assume !(0 != main_~p10~0#1); 517#L191-1 assume !(0 != main_~p11~0#1); 515#L196-1 assume !(0 != main_~p12~0#1); 512#L201-1 assume !(0 != main_~p13~0#1); 511#L206-1 assume 0 != main_~p14~0#1; 510#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 444#L211 [2024-11-13 14:40:43,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-13 14:40:43,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:43,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720604330] [2024-11-13 14:40:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:43,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:43,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:43,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1067277945, now seen corresponding path program 1 times [2024-11-13 14:40:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:43,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479670470] [2024-11-13 14:40:43,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:43,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:43,693 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:40:43,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:40:43,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479670470] [2024-11-13 14:40:43,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479670470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:40:43,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:40:43,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:40:43,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518806566] [2024-11-13 14:40:43,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:40:43,694 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:40:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:40:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:40:43,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:40:43,695 INFO L87 Difference]: Start difference. First operand 174 states and 270 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:40:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:43,732 INFO L93 Difference]: Finished difference Result 342 states and 526 transitions. [2024-11-13 14:40:43,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 526 transitions. [2024-11-13 14:40:43,740 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2024-11-13 14:40:43,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 526 transitions. [2024-11-13 14:40:43,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2024-11-13 14:40:43,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2024-11-13 14:40:43,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 526 transitions. [2024-11-13 14:40:43,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:40:43,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 342 states and 526 transitions. [2024-11-13 14:40:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 526 transitions. [2024-11-13 14:40:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-13 14:40:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5380116959064327) internal successors, (526), 341 states have internal predecessors, (526), 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:40:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 526 transitions. [2024-11-13 14:40:43,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 342 states and 526 transitions. [2024-11-13 14:40:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:40:43,780 INFO L424 stractBuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2024-11-13 14:40:43,780 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 14:40:43,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 526 transitions. [2024-11-13 14:40:43,783 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2024-11-13 14:40:43,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:43,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:43,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:43,783 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:43,784 INFO L745 eck$LassoCheckResult]: Stem: 1005#$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(18, 2);call #Ultimate.allocInit(12, 3); 966#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~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_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 967#L211 [2024-11-13 14:40:43,784 INFO L747 eck$LassoCheckResult]: Loop: 967#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1034#L55 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;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 1030#L88 assume !(0 != main_~p1~0#1); 1024#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 1020#L92-1 assume !(0 != main_~p3~0#1); 1021#L96-1 assume !(0 != main_~p4~0#1); 1117#L100-1 assume !(0 != main_~p5~0#1); 1114#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1113#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1111#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1109#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1106#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1103#L124-1 assume !(0 != main_~p11~0#1); 1102#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1101#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1098#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1094#L140-1 assume !(0 != main_~p1~0#1); 1091#L146-1 assume 0 != main_~p2~0#1; 1090#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 1089#L151 assume !(0 != main_~p3~0#1); 1086#L156-1 assume !(0 != main_~p4~0#1); 1084#L161-1 assume !(0 != main_~p5~0#1); 1083#L166-1 assume !(0 != main_~p6~0#1); 1081#L171-1 assume !(0 != main_~p7~0#1); 1079#L176-1 assume !(0 != main_~p8~0#1); 1077#L181-1 assume !(0 != main_~p9~0#1); 1074#L186-1 assume !(0 != main_~p10~0#1); 1073#L191-1 assume !(0 != main_~p11~0#1); 1071#L196-1 assume !(0 != main_~p12~0#1); 1052#L201-1 assume !(0 != main_~p13~0#1); 1045#L206-1 assume 0 != main_~p14~0#1; 1041#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 967#L211 [2024-11-13 14:40:43,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:43,785 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-13 14:40:43,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:43,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816661737] [2024-11-13 14:40:43,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:43,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:43,790 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:43,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:43,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:43,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1129317559, now seen corresponding path program 1 times [2024-11-13 14:40:43,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:43,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775465800] [2024-11-13 14:40:43,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:43,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:43,844 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:40:43,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:40:43,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775465800] [2024-11-13 14:40:43,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775465800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:40:43,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:40:43,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:40:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974059222] [2024-11-13 14:40:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:40:43,845 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:40:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:40:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:40:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:40:43,846 INFO L87 Difference]: Start difference. First operand 342 states and 526 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:40:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:43,867 INFO L93 Difference]: Finished difference Result 674 states and 1026 transitions. [2024-11-13 14:40:43,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1026 transitions. [2024-11-13 14:40:43,873 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2024-11-13 14:40:43,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1026 transitions. [2024-11-13 14:40:43,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2024-11-13 14:40:43,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2024-11-13 14:40:43,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1026 transitions. [2024-11-13 14:40:43,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:40:43,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 674 states and 1026 transitions. [2024-11-13 14:40:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1026 transitions. [2024-11-13 14:40:43,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2024-11-13 14:40:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5222551928783383) internal successors, (1026), 673 states have internal predecessors, (1026), 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:40:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1026 transitions. [2024-11-13 14:40:43,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 674 states and 1026 transitions. [2024-11-13 14:40:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:40:43,919 INFO L424 stractBuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2024-11-13 14:40:43,919 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 14:40:43,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1026 transitions. [2024-11-13 14:40:43,925 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2024-11-13 14:40:43,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:43,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:43,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:43,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:43,927 INFO L745 eck$LassoCheckResult]: Stem: 2024#$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(18, 2);call #Ultimate.allocInit(12, 3); 1988#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~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_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 1989#L211 [2024-11-13 14:40:43,927 INFO L747 eck$LassoCheckResult]: Loop: 1989#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2059#L55 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;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 2060#L88 assume !(0 != main_~p1~0#1); 2191#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 2189#L92-1 assume !(0 != main_~p3~0#1); 2185#L96-1 assume !(0 != main_~p4~0#1); 2181#L100-1 assume !(0 != main_~p5~0#1); 2179#L104-1 assume !(0 != main_~p6~0#1); 2177#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2175#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2173#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2171#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2169#L124-1 assume !(0 != main_~p11~0#1); 2167#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2165#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2163#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2159#L140-1 assume !(0 != main_~p1~0#1); 2157#L146-1 assume 0 != main_~p2~0#1; 2155#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 2152#L151 assume !(0 != main_~p3~0#1); 2147#L156-1 assume !(0 != main_~p4~0#1); 2143#L161-1 assume !(0 != main_~p5~0#1); 2141#L166-1 assume !(0 != main_~p6~0#1); 2138#L171-1 assume !(0 != main_~p7~0#1); 2137#L176-1 assume !(0 != main_~p8~0#1); 2132#L181-1 assume !(0 != main_~p9~0#1); 2131#L186-1 assume !(0 != main_~p10~0#1); 2126#L191-1 assume !(0 != main_~p11~0#1); 2125#L196-1 assume !(0 != main_~p12~0#1); 2092#L201-1 assume !(0 != main_~p13~0#1); 2093#L206-1 assume 0 != main_~p14~0#1; 2075#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 1989#L211 [2024-11-13 14:40:43,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:43,928 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-13 14:40:43,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:43,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195087034] [2024-11-13 14:40:43,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:43,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:43,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:43,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:43,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1269866169, now seen corresponding path program 1 times [2024-11-13 14:40:43,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:43,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878597255] [2024-11-13 14:40:43,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:43,977 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:40:43,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:40:43,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878597255] [2024-11-13 14:40:43,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878597255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:40:43,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:40:43,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:40:43,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996981392] [2024-11-13 14:40:43,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:40:43,978 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:40:43,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:40:43,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:40:43,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:40:43,978 INFO L87 Difference]: Start difference. First operand 674 states and 1026 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:40:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:44,006 INFO L93 Difference]: Finished difference Result 1330 states and 2002 transitions. [2024-11-13 14:40:44,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2002 transitions. [2024-11-13 14:40:44,018 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2024-11-13 14:40:44,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2002 transitions. [2024-11-13 14:40:44,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2024-11-13 14:40:44,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2024-11-13 14:40:44,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2002 transitions. [2024-11-13 14:40:44,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:40:44,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2024-11-13 14:40:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2002 transitions. [2024-11-13 14:40:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2024-11-13 14:40:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5052631578947369) internal successors, (2002), 1329 states have internal predecessors, (2002), 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:40:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2002 transitions. [2024-11-13 14:40:44,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2024-11-13 14:40:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:40:44,065 INFO L424 stractBuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2024-11-13 14:40:44,065 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 14:40:44,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2002 transitions. [2024-11-13 14:40:44,074 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2024-11-13 14:40:44,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:44,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:44,076 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:44,076 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:44,077 INFO L745 eck$LassoCheckResult]: Stem: 4030#$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(18, 2);call #Ultimate.allocInit(12, 3); 3998#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~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_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 3999#L211 [2024-11-13 14:40:44,077 INFO L747 eck$LassoCheckResult]: Loop: 3999#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4117#L55 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;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 4118#L88 assume !(0 != main_~p1~0#1); 4248#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4245#L92-1 assume !(0 != main_~p3~0#1); 4242#L96-1 assume !(0 != main_~p4~0#1); 4237#L100-1 assume !(0 != main_~p5~0#1); 4231#L104-1 assume !(0 != main_~p6~0#1); 4225#L108-1 assume !(0 != main_~p7~0#1); 4221#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4218#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4215#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4213#L124-1 assume !(0 != main_~p11~0#1); 4175#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4176#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4169#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4170#L140-1 assume !(0 != main_~p1~0#1); 4150#L146-1 assume 0 != main_~p2~0#1; 4149#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 4148#L151 assume !(0 != main_~p3~0#1); 4147#L156-1 assume !(0 != main_~p4~0#1); 4305#L161-1 assume !(0 != main_~p5~0#1); 4301#L166-1 assume !(0 != main_~p6~0#1); 4295#L171-1 assume !(0 != main_~p7~0#1); 4294#L176-1 assume !(0 != main_~p8~0#1); 4292#L181-1 assume !(0 != main_~p9~0#1); 4164#L186-1 assume !(0 != main_~p10~0#1); 4161#L191-1 assume !(0 != main_~p11~0#1); 4157#L196-1 assume !(0 != main_~p12~0#1); 4139#L201-1 assume !(0 != main_~p13~0#1); 4132#L206-1 assume 0 != main_~p14~0#1; 4128#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 3999#L211 [2024-11-13 14:40:44,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:44,078 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-13 14:40:44,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:44,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022007593] [2024-11-13 14:40:44,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:44,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:44,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:44,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:44,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1135852663, now seen corresponding path program 1 times [2024-11-13 14:40:44,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:44,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250501411] [2024-11-13 14:40:44,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:44,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:44,149 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:40:44,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:40:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250501411] [2024-11-13 14:40:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250501411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:40:44,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:40:44,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:40:44,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070239019] [2024-11-13 14:40:44,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:40:44,154 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:40:44,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:40:44,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:40:44,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:40:44,154 INFO L87 Difference]: Start difference. First operand 1330 states and 2002 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:40:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:44,188 INFO L93 Difference]: Finished difference Result 2626 states and 3906 transitions. [2024-11-13 14:40:44,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 3906 transitions. [2024-11-13 14:40:44,260 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2024-11-13 14:40:44,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 3906 transitions. [2024-11-13 14:40:44,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2024-11-13 14:40:44,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2024-11-13 14:40:44,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 3906 transitions. [2024-11-13 14:40:44,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:40:44,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2024-11-13 14:40:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 3906 transitions. [2024-11-13 14:40:44,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2024-11-13 14:40:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.4874333587204875) internal successors, (3906), 2625 states have internal predecessors, (3906), 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:40:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3906 transitions. [2024-11-13 14:40:44,346 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2024-11-13 14:40:44,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:40:44,348 INFO L424 stractBuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2024-11-13 14:40:44,348 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 14:40:44,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 3906 transitions. [2024-11-13 14:40:44,364 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2024-11-13 14:40:44,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:44,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:44,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:44,367 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:44,367 INFO L745 eck$LassoCheckResult]: Stem: 8000#$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(18, 2);call #Ultimate.allocInit(12, 3); 7961#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~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_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 7962#L211 [2024-11-13 14:40:44,367 INFO L747 eck$LassoCheckResult]: Loop: 7962#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8434#L55 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;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 8420#L88 assume !(0 != main_~p1~0#1); 8422#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 8407#L92-1 assume !(0 != main_~p3~0#1); 8408#L96-1 assume !(0 != main_~p4~0#1); 8534#L100-1 assume !(0 != main_~p5~0#1); 8529#L104-1 assume !(0 != main_~p6~0#1); 8523#L108-1 assume !(0 != main_~p7~0#1); 8524#L112-1 assume !(0 != main_~p8~0#1); 8588#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8586#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8583#L124-1 assume !(0 != main_~p11~0#1); 8577#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8571#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8569#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8567#L140-1 assume !(0 != main_~p1~0#1); 8566#L146-1 assume 0 != main_~p2~0#1; 8563#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 8560#L151 assume !(0 != main_~p3~0#1); 8557#L156-1 assume !(0 != main_~p4~0#1); 8558#L161-1 assume !(0 != main_~p5~0#1); 8581#L166-1 assume !(0 != main_~p6~0#1); 8482#L171-1 assume !(0 != main_~p7~0#1); 8479#L176-1 assume !(0 != main_~p8~0#1); 8477#L181-1 assume !(0 != main_~p9~0#1); 8471#L186-1 assume !(0 != main_~p10~0#1); 8468#L191-1 assume !(0 != main_~p11~0#1); 8464#L196-1 assume !(0 != main_~p12~0#1); 8463#L201-1 assume !(0 != main_~p13~0#1); 8446#L206-1 assume 0 != main_~p14~0#1; 8447#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 7962#L211 [2024-11-13 14:40:44,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-13 14:40:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:44,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594712479] [2024-11-13 14:40:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:44,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:44,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:44,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:44,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash -669585671, now seen corresponding path program 1 times [2024-11-13 14:40:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:44,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80534978] [2024-11-13 14:40:44,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:44,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:44,412 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:40:44,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:40:44,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80534978] [2024-11-13 14:40:44,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80534978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:40:44,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:40:44,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:40:44,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760219146] [2024-11-13 14:40:44,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:40:44,414 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:40:44,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:40:44,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:40:44,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:40:44,415 INFO L87 Difference]: Start difference. First operand 2626 states and 3906 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:40:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:44,460 INFO L93 Difference]: Finished difference Result 5186 states and 7618 transitions. [2024-11-13 14:40:44,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7618 transitions. [2024-11-13 14:40:44,501 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2024-11-13 14:40:44,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7618 transitions. [2024-11-13 14:40:44,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2024-11-13 14:40:44,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2024-11-13 14:40:44,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7618 transitions. [2024-11-13 14:40:44,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:40:44,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2024-11-13 14:40:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7618 transitions. [2024-11-13 14:40:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2024-11-13 14:40:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.4689548785190898) internal successors, (7618), 5185 states have internal predecessors, (7618), 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:40:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7618 transitions. [2024-11-13 14:40:44,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2024-11-13 14:40:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:40:44,703 INFO L424 stractBuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2024-11-13 14:40:44,703 INFO L331 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-13 14:40:44,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7618 transitions. [2024-11-13 14:40:44,736 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2024-11-13 14:40:44,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:44,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:44,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:44,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:44,738 INFO L745 eck$LassoCheckResult]: Stem: 15812#$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(18, 2);call #Ultimate.allocInit(12, 3); 15777#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~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_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 15778#L211 [2024-11-13 14:40:44,738 INFO L747 eck$LassoCheckResult]: Loop: 15778#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16180#L55 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;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 16176#L88 assume !(0 != main_~p1~0#1); 16174#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 16172#L92-1 assume !(0 != main_~p3~0#1); 16168#L96-1 assume !(0 != main_~p4~0#1); 16164#L100-1 assume !(0 != main_~p5~0#1); 16161#L104-1 assume !(0 != main_~p6~0#1); 16162#L108-1 assume !(0 != main_~p7~0#1); 16244#L112-1 assume !(0 != main_~p8~0#1); 16241#L116-1 assume !(0 != main_~p9~0#1); 16239#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 16237#L124-1 assume !(0 != main_~p11~0#1); 16235#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 16233#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 16231#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 16229#L140-1 assume !(0 != main_~p1~0#1); 16226#L146-1 assume 0 != main_~p2~0#1; 16223#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 16220#L151 assume !(0 != main_~p3~0#1); 16216#L156-1 assume !(0 != main_~p4~0#1); 16214#L161-1 assume !(0 != main_~p5~0#1); 16213#L166-1 assume !(0 != main_~p6~0#1); 16209#L171-1 assume !(0 != main_~p7~0#1); 16205#L176-1 assume !(0 != main_~p8~0#1); 16201#L181-1 assume !(0 != main_~p9~0#1); 16197#L186-1 assume !(0 != main_~p10~0#1); 16194#L191-1 assume !(0 != main_~p11~0#1); 16192#L196-1 assume !(0 != main_~p12~0#1); 16187#L201-1 assume !(0 != main_~p13~0#1); 16185#L206-1 assume 0 != main_~p14~0#1; 16183#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 15778#L211 [2024-11-13 14:40:44,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-13 14:40:44,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:44,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339867565] [2024-11-13 14:40:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:44,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:44,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:44,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:44,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash -450730953, now seen corresponding path program 1 times [2024-11-13 14:40:44,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:44,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710310919] [2024-11-13 14:40:44,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:44,809 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:40:44,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:40:44,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710310919] [2024-11-13 14:40:44,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710310919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:40:44,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:40:44,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:40:44,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752734191] [2024-11-13 14:40:44,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:40:44,812 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:40:44,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:40:44,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:40:44,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:40:44,815 INFO L87 Difference]: Start difference. First operand 5186 states and 7618 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:40:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:44,884 INFO L93 Difference]: Finished difference Result 10242 states and 14850 transitions. [2024-11-13 14:40:44,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 14850 transitions. [2024-11-13 14:40:44,961 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2024-11-13 14:40:45,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 14850 transitions. [2024-11-13 14:40:45,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2024-11-13 14:40:45,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2024-11-13 14:40:45,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 14850 transitions. [2024-11-13 14:40:45,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:40:45,056 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2024-11-13 14:40:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 14850 transitions. [2024-11-13 14:40:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2024-11-13 14:40:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4499121265377857) internal successors, (14850), 10241 states have internal predecessors, (14850), 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:40:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 14850 transitions. [2024-11-13 14:40:45,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2024-11-13 14:40:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:40:45,324 INFO L424 stractBuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2024-11-13 14:40:45,325 INFO L331 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-13 14:40:45,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 14850 transitions. [2024-11-13 14:40:45,366 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2024-11-13 14:40:45,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:45,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:45,367 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:45,367 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:45,367 INFO L745 eck$LassoCheckResult]: Stem: 31247#$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(18, 2);call #Ultimate.allocInit(12, 3); 31212#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~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_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 31213#L211 [2024-11-13 14:40:45,369 INFO L747 eck$LassoCheckResult]: Loop: 31213#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31938#L55 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;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 31936#L88 assume !(0 != main_~p1~0#1); 31935#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 31934#L92-1 assume !(0 != main_~p3~0#1); 31932#L96-1 assume !(0 != main_~p4~0#1); 31930#L100-1 assume !(0 != main_~p5~0#1); 31927#L104-1 assume !(0 != main_~p6~0#1); 31928#L108-1 assume !(0 != main_~p7~0#1); 31908#L112-1 assume !(0 != main_~p8~0#1); 31910#L116-1 assume !(0 != main_~p9~0#1); 31891#L120-1 assume !(0 != main_~p10~0#1); 31893#L124-1 assume !(0 != main_~p11~0#1); 31879#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 31880#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 31866#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 31867#L140-1 assume !(0 != main_~p1~0#1); 31853#L146-1 assume 0 != main_~p2~0#1; 31854#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 31841#L151 assume !(0 != main_~p3~0#1); 31840#L156-1 assume !(0 != main_~p4~0#1); 31827#L161-1 assume !(0 != main_~p5~0#1); 31828#L166-1 assume !(0 != main_~p6~0#1); 31953#L171-1 assume !(0 != main_~p7~0#1); 31951#L176-1 assume !(0 != main_~p8~0#1); 31949#L181-1 assume !(0 != main_~p9~0#1); 31947#L186-1 assume !(0 != main_~p10~0#1); 31946#L191-1 assume !(0 != main_~p11~0#1); 31944#L196-1 assume !(0 != main_~p12~0#1); 31941#L201-1 assume !(0 != main_~p13~0#1); 31940#L206-1 assume 0 != main_~p14~0#1; 31939#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 31213#L211 [2024-11-13 14:40:45,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:45,369 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-13 14:40:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:45,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44221906] [2024-11-13 14:40:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:45,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:45,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:45,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash -28029127, now seen corresponding path program 1 times [2024-11-13 14:40:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:45,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686642807] [2024-11-13 14:40:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:45,434 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:40:45,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:40:45,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686642807] [2024-11-13 14:40:45,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686642807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:40:45,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:40:45,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:40:45,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264481094] [2024-11-13 14:40:45,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:40:45,435 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:40:45,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:40:45,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:40:45,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:40:45,436 INFO L87 Difference]: Start difference. First operand 10242 states and 14850 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:40:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:45,520 INFO L93 Difference]: Finished difference Result 20226 states and 28930 transitions. [2024-11-13 14:40:45,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 28930 transitions. [2024-11-13 14:40:45,642 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2024-11-13 14:40:45,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 28930 transitions. [2024-11-13 14:40:45,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2024-11-13 14:40:45,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2024-11-13 14:40:45,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 28930 transitions. [2024-11-13 14:40:45,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:40:45,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2024-11-13 14:40:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 28930 transitions. [2024-11-13 14:40:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2024-11-13 14:40:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.43033718975576) internal successors, (28930), 20225 states have internal predecessors, (28930), 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:40:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 28930 transitions. [2024-11-13 14:40:46,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2024-11-13 14:40:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:40:46,316 INFO L424 stractBuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2024-11-13 14:40:46,316 INFO L331 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-13 14:40:46,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 28930 transitions. [2024-11-13 14:40:46,374 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2024-11-13 14:40:46,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:46,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:46,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:46,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:46,375 INFO L745 eck$LassoCheckResult]: Stem: 61720#$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(18, 2);call #Ultimate.allocInit(12, 3); 61686#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~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_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 61687#L211 [2024-11-13 14:40:46,376 INFO L747 eck$LassoCheckResult]: Loop: 61687#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 62344#L55 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;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 62343#L88 assume !(0 != main_~p1~0#1); 62342#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 62341#L92-1 assume !(0 != main_~p3~0#1); 62339#L96-1 assume !(0 != main_~p4~0#1); 62337#L100-1 assume !(0 != main_~p5~0#1); 62335#L104-1 assume !(0 != main_~p6~0#1); 62334#L108-1 assume !(0 != main_~p7~0#1); 62326#L112-1 assume !(0 != main_~p8~0#1); 62328#L116-1 assume !(0 != main_~p9~0#1); 62317#L120-1 assume !(0 != main_~p10~0#1); 62318#L124-1 assume !(0 != main_~p11~0#1); 62553#L128-1 assume !(0 != main_~p12~0#1); 62549#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 62546#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 62128#L140-1 assume !(0 != main_~p1~0#1); 62129#L146-1 assume 0 != main_~p2~0#1; 62366#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 62364#L151 assume !(0 != main_~p3~0#1); 62277#L156-1 assume !(0 != main_~p4~0#1); 62278#L161-1 assume !(0 != main_~p5~0#1); 62266#L166-1 assume !(0 != main_~p6~0#1); 62267#L171-1 assume !(0 != main_~p7~0#1); 62357#L176-1 assume !(0 != main_~p8~0#1); 62355#L181-1 assume !(0 != main_~p9~0#1); 62353#L186-1 assume !(0 != main_~p10~0#1); 62352#L191-1 assume !(0 != main_~p11~0#1); 62349#L196-1 assume !(0 != main_~p12~0#1); 62347#L201-1 assume !(0 != main_~p13~0#1); 62346#L206-1 assume 0 != main_~p14~0#1; 62345#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 61687#L211 [2024-11-13 14:40:46,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-11-13 14:40:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:46,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242001410] [2024-11-13 14:40:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:46,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:46,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:46,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:46,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1716972869, now seen corresponding path program 1 times [2024-11-13 14:40:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:46,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526315643] [2024-11-13 14:40:46,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:46,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:46,422 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:40:46,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:40:46,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526315643] [2024-11-13 14:40:46,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526315643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:40:46,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:40:46,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:40:46,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545672993] [2024-11-13 14:40:46,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:40:46,423 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 14:40:46,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:40:46,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:40:46,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:40:46,424 INFO L87 Difference]: Start difference. First operand 20226 states and 28930 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:40:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:46,546 INFO L93 Difference]: Finished difference Result 39938 states and 56322 transitions. [2024-11-13 14:40:46,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 56322 transitions. [2024-11-13 14:40:46,702 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2024-11-13 14:40:47,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 56322 transitions. [2024-11-13 14:40:47,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2024-11-13 14:40:47,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2024-11-13 14:40:47,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 56322 transitions. [2024-11-13 14:40:47,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 14:40:47,213 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2024-11-13 14:40:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 56322 transitions. [2024-11-13 14:40:47,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2024-11-13 14:40:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4102358655916671) internal successors, (56322), 39937 states have internal predecessors, (56322), 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:40:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 56322 transitions. [2024-11-13 14:40:48,157 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2024-11-13 14:40:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:40:48,159 INFO L424 stractBuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2024-11-13 14:40:48,159 INFO L331 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-13 14:40:48,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 56322 transitions. [2024-11-13 14:40:48,256 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2024-11-13 14:40:48,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 14:40:48,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 14:40:48,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 14:40:48,258 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:48,258 INFO L745 eck$LassoCheckResult]: Stem: 121892#$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(18, 2);call #Ultimate.allocInit(12, 3); 121854#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~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_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 121855#L211 [2024-11-13 14:40:48,258 INFO L747 eck$LassoCheckResult]: Loop: 121855#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 122050#L55 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;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 122046#L88 assume !(0 != main_~p1~0#1); 122042#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 122038#L92-1 assume !(0 != main_~p3~0#1); 122031#L96-1 assume !(0 != main_~p4~0#1); 122023#L100-1 assume !(0 != main_~p5~0#1); 122015#L104-1 assume !(0 != main_~p6~0#1); 122007#L108-1 assume !(0 != main_~p7~0#1); 121999#L112-1 assume !(0 != main_~p8~0#1); 121991#L116-1 assume !(0 != main_~p9~0#1); 121983#L120-1 assume !(0 != main_~p10~0#1); 121978#L124-1 assume !(0 != main_~p11~0#1); 121971#L128-1 assume !(0 != main_~p12~0#1); 121965#L132-1 assume !(0 != main_~p13~0#1); 121959#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 121960#L140-1 assume !(0 != main_~p1~0#1); 122141#L146-1 assume 0 != main_~p2~0#1; 122139#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 122137#L151 assume !(0 != main_~p3~0#1); 122133#L156-1 assume !(0 != main_~p4~0#1); 122126#L161-1 assume !(0 != main_~p5~0#1); 122118#L166-1 assume !(0 != main_~p6~0#1); 122110#L171-1 assume !(0 != main_~p7~0#1); 122102#L176-1 assume !(0 != main_~p8~0#1); 122090#L181-1 assume !(0 != main_~p9~0#1); 122086#L186-1 assume !(0 != main_~p10~0#1); 122077#L191-1 assume !(0 != main_~p11~0#1); 122069#L196-1 assume !(0 != main_~p12~0#1); 122065#L201-1 assume !(0 != main_~p13~0#1); 122061#L206-1 assume 0 != main_~p14~0#1; 122057#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 121855#L211 [2024-11-13 14:40:48,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:48,259 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-11-13 14:40:48,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:48,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784327081] [2024-11-13 14:40:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:48,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:48,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:48,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:48,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash 583849721, now seen corresponding path program 1 times [2024-11-13 14:40:48,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:48,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768371482] [2024-11-13 14:40:48,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:48,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:48,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:48,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:48,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash 125653691, now seen corresponding path program 1 times [2024-11-13 14:40:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:40:48,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824054717] [2024-11-13 14:40:48,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:48,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:40:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:48,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:48,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:40:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:49,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:40:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:40:49,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 02:40:49 BoogieIcfgContainer [2024-11-13 14:40:49,219 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-13 14:40:49,220 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:40:49,220 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:40:49,220 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:40:49,221 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:40:42" (3/4) ... [2024-11-13 14:40:49,225 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-13 14:40:49,272 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:40:49,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:40:49,275 INFO L158 Benchmark]: Toolchain (without parser) took 7409.81ms. Allocated memory was 142.6MB in the beginning and 989.9MB in the end (delta: 847.2MB). Free memory was 119.1MB in the beginning and 683.1MB in the end (delta: -564.0MB). Peak memory consumption was 283.3MB. Max. memory is 16.1GB. [2024-11-13 14:40:49,275 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 142.6MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:40:49,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.57ms. Allocated memory is still 142.6MB. Free memory was 118.9MB in the beginning and 107.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:40:49,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.27ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 105.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:40:49,276 INFO L158 Benchmark]: Boogie Preprocessor took 65.78ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 104.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:40:49,276 INFO L158 Benchmark]: RCFGBuilder took 501.99ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 88.4MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:40:49,277 INFO L158 Benchmark]: BuchiAutomizer took 6472.75ms. Allocated memory was 142.6MB in the beginning and 989.9MB in the end (delta: 847.2MB). Free memory was 88.4MB in the beginning and 687.2MB in the end (delta: -598.7MB). Peak memory consumption was 249.8MB. Max. memory is 16.1GB. [2024-11-13 14:40:49,277 INFO L158 Benchmark]: Witness Printer took 52.07ms. Allocated memory is still 989.9MB. Free memory was 687.2MB in the beginning and 683.1MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:40:49,280 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.43ms. Allocated memory is still 142.6MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.57ms. Allocated memory is still 142.6MB. Free memory was 118.9MB in the beginning and 107.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.27ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 105.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.78ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 104.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 501.99ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 88.4MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6472.75ms. Allocated memory was 142.6MB in the beginning and 989.9MB in the end (delta: 847.2MB). Free memory was 88.4MB in the beginning and 687.2MB in the end (delta: -598.7MB). Peak memory consumption was 249.8MB. Max. memory is 16.1GB. * Witness Printer took 52.07ms. Allocated memory is still 989.9MB. Free memory was 687.2MB in the beginning and 683.1MB in the end (delta: 4.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 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 39938 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 3.9s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 2.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.1s 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, 549 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 549 mSDsluCounter, 1760 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 678 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1082 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI10 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: 53]: 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; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND TRUE p2 != 0 [L93] lk2 = 1 [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND TRUE p14 != 0 [L141] lk14 = 1 [L146] COND FALSE !(p1 != 0) [L151] COND TRUE p2 != 0 [L152] COND FALSE !(lk2 != 1) [L153] lk2 = 0 [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND TRUE p14 != 0 [L212] COND FALSE !(lk14 != 1) [L213] lk14 = 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: 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; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND TRUE p2 != 0 [L93] lk2 = 1 [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND TRUE p14 != 0 [L141] lk14 = 1 [L146] COND FALSE !(p1 != 0) [L151] COND TRUE p2 != 0 [L152] COND FALSE !(lk2 != 1) [L153] lk2 = 0 [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND TRUE p14 != 0 [L212] COND FALSE !(lk14 != 1) [L213] lk14 = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 14:40:49,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16cd91b-84a9-4aaf-98d4-b20b8347cd30/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)