./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:23:03,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:23:03,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:23:03,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:23:03,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:23:03,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:23:03,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:23:03,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:23:03,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:23:03,626 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:23:03,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:23:03,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:23:03,627 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:23:03,631 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:23:03,632 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:23:03,632 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:23:03,632 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:23:03,632 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:23:03,632 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:23:03,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:23:03,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:23:03,634 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:23:03,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:23:03,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:23:03,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:23:03,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:23:03,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:23:03,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:23:03,635 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:23:03,636 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:23:03,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:23:03,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:23:03,636 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:23:03,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:23:03,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:23:03,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:23:03,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:23:03,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:23:03,638 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:23:03,639 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2024-10-15 00:23:03,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:23:03,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:23:03,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:23:03,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:23:03,935 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:23:03,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-10-15 00:23:05,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:23:05,851 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:23:05,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-10-15 00:23:05,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7140fb36/3d8ac267a0e74dad8ed99ca85685638f/FLAG84f988cfe [2024-10-15 00:23:05,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7140fb36/3d8ac267a0e74dad8ed99ca85685638f [2024-10-15 00:23:05,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:23:05,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:23:05,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:23:05,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:23:05,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:23:05,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:23:05" (1/1) ... [2024-10-15 00:23:05,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4a205d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:05, skipping insertion in model container [2024-10-15 00:23:05,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:23:05" (1/1) ... [2024-10-15 00:23:05,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:23:06,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:23:06,249 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:23:06,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:23:06,302 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:23:06,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06 WrapperNode [2024-10-15 00:23:06,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:23:06,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:23:06,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:23:06,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:23:06,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,362 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 193 [2024-10-15 00:23:06,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:23:06,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:23:06,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:23:06,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:23:06,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,406 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-10-15 00:23:06,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:23:06,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:23:06,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:23:06,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:23:06,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (1/1) ... [2024-10-15 00:23:06,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:06,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:06,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:06,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:23:06,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 00:23:06,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:23:06,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:23:06,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 00:23:06,699 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:23:06,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:23:07,050 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-15 00:23:07,051 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:23:07,068 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:23:07,069 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 00:23:07,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:23:07 BoogieIcfgContainer [2024-10-15 00:23:07,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:23:07,070 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:23:07,071 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:23:07,077 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:23:07,077 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:23:07,078 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:23:05" (1/3) ... [2024-10-15 00:23:07,078 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8c2a091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:23:07, skipping insertion in model container [2024-10-15 00:23:07,078 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:23:07,078 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:06" (2/3) ... [2024-10-15 00:23:07,079 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8c2a091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:23:07, skipping insertion in model container [2024-10-15 00:23:07,079 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:23:07,079 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:23:07" (3/3) ... [2024-10-15 00:23:07,080 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2024-10-15 00:23:07,152 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:23:07,152 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:23:07,153 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:23:07,153 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:23:07,153 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:23:07,153 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:23:07,154 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:23:07,154 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:23:07,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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-10-15 00:23:07,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-10-15 00:23:07,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:07,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:07,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:07,198 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-10-15 00:23:07,198 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:23:07,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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-10-15 00:23:07,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-10-15 00:23:07,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:07,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:07,206 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:07,206 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-10-15 00:23:07,217 INFO L745 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 33#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 19#L225-1true [2024-10-15 00:23:07,221 INFO L747 eck$LassoCheckResult]: Loop: 19#L225-1true assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 32#L58true 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;main_~lk15~0#1 := 0; 28#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 25#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L97-1true assume !(0 != main_~p3~0#1); 15#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 51#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 44#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 21#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 35#L129-1true assume !(0 != main_~p11~0#1); 3#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 5#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 39#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 55#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 48#L149-1true assume !(0 != main_~p1~0#1); 46#L155-1true assume !(0 != main_~p2~0#1); 27#L160-1true assume !(0 != main_~p3~0#1); 10#L165-1true assume !(0 != main_~p4~0#1); 42#L170-1true assume !(0 != main_~p5~0#1); 45#L175-1true assume !(0 != main_~p6~0#1); 17#L180-1true assume !(0 != main_~p7~0#1); 38#L185-1true assume !(0 != main_~p8~0#1); 23#L190-1true assume !(0 != main_~p9~0#1); 41#L195-1true assume !(0 != main_~p10~0#1); 14#L200-1true assume !(0 != main_~p11~0#1); 43#L205-1true assume !(0 != main_~p12~0#1); 22#L210-1true assume !(0 != main_~p13~0#1); 4#L215-1true assume !(0 != main_~p14~0#1); 36#L220-1true assume !(0 != main_~p15~0#1); 19#L225-1true [2024-10-15 00:23:07,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:07,245 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:23:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:07,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872747411] [2024-10-15 00:23:07,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:07,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:07,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:07,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:07,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2064553094, now seen corresponding path program 1 times [2024-10-15 00:23:07,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:07,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965516825] [2024-10-15 00:23:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:07,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:07,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965516825] [2024-10-15 00:23:07,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965516825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:07,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:07,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:07,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363641458] [2024-10-15 00:23:07,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:07,729 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:07,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:07,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:07,761 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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-10-15 00:23:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:07,801 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2024-10-15 00:23:07,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 189 transitions. [2024-10-15 00:23:07,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2024-10-15 00:23:07,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 95 states and 153 transitions. [2024-10-15 00:23:07,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-10-15 00:23:07,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-10-15 00:23:07,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 153 transitions. [2024-10-15 00:23:07,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:07,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-10-15 00:23:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 153 transitions. [2024-10-15 00:23:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-15 00:23:07,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 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-10-15 00:23:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2024-10-15 00:23:07,843 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-10-15 00:23:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:07,848 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-10-15 00:23:07,848 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:23:07,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 153 transitions. [2024-10-15 00:23:07,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2024-10-15 00:23:07,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:07,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:07,851 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:07,851 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-10-15 00:23:07,851 INFO L745 eck$LassoCheckResult]: Stem: 204#$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); 205#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 211#L225-1 [2024-10-15 00:23:07,851 INFO L747 eck$LassoCheckResult]: Loop: 211#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 222#L58 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;main_~lk15~0#1 := 0; 221#L93 assume !(0 != main_~p1~0#1); 206#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 184#L97-1 assume !(0 != main_~p3~0#1); 185#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 189#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 217#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 182#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 183#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 256#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 190#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 191#L129-1 assume !(0 != main_~p11~0#1); 212#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 254#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 253#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 252#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 251#L149-1 assume !(0 != main_~p1~0#1); 250#L155-1 assume !(0 != main_~p2~0#1); 248#L160-1 assume !(0 != main_~p3~0#1); 246#L165-1 assume !(0 != main_~p4~0#1); 243#L170-1 assume !(0 != main_~p5~0#1); 242#L175-1 assume !(0 != main_~p6~0#1); 240#L180-1 assume !(0 != main_~p7~0#1); 237#L185-1 assume !(0 != main_~p8~0#1); 236#L190-1 assume !(0 != main_~p9~0#1); 234#L195-1 assume !(0 != main_~p10~0#1); 232#L200-1 assume !(0 != main_~p11~0#1); 230#L205-1 assume !(0 != main_~p12~0#1); 228#L210-1 assume !(0 != main_~p13~0#1); 226#L215-1 assume !(0 != main_~p14~0#1); 224#L220-1 assume !(0 != main_~p15~0#1); 211#L225-1 [2024-10-15 00:23:07,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-15 00:23:07,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:07,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617969364] [2024-10-15 00:23:07,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:07,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:07,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:07,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:07,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:07,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2087185348, now seen corresponding path program 1 times [2024-10-15 00:23:07,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:07,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701975758] [2024-10-15 00:23:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:07,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:07,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:07,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701975758] [2024-10-15 00:23:07,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701975758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:07,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:07,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:07,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663274480] [2024-10-15 00:23:07,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:07,923 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:07,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:07,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:07,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:07,925 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. cyclomatic complexity: 60 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-10-15 00:23:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:07,944 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2024-10-15 00:23:07,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 298 transitions. [2024-10-15 00:23:07,947 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2024-10-15 00:23:07,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 298 transitions. [2024-10-15 00:23:07,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2024-10-15 00:23:07,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2024-10-15 00:23:07,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 298 transitions. [2024-10-15 00:23:07,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:07,951 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 298 transitions. [2024-10-15 00:23:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 298 transitions. [2024-10-15 00:23:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-10-15 00:23:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 185 states have internal predecessors, (298), 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-10-15 00:23:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2024-10-15 00:23:07,961 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 298 transitions. [2024-10-15 00:23:07,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:07,962 INFO L425 stractBuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2024-10-15 00:23:07,962 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:23:07,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 298 transitions. [2024-10-15 00:23:07,964 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2024-10-15 00:23:07,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:07,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:07,965 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:07,966 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-10-15 00:23:07,966 INFO L745 eck$LassoCheckResult]: Stem: 491#$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); 492#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 498#L225-1 [2024-10-15 00:23:07,966 INFO L747 eck$LassoCheckResult]: Loop: 498#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 516#L58 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;main_~lk15~0#1 := 0; 512#L93 assume !(0 != main_~p1~0#1); 513#L93-2 assume !(0 != main_~p2~0#1); 639#L97-1 assume !(0 != main_~p3~0#1); 638#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 637#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 636#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 635#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 634#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 633#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 632#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 499#L129-1 assume !(0 != main_~p11~0#1); 500#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 527#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 528#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 523#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 524#L149-1 assume !(0 != main_~p1~0#1); 608#L155-1 assume !(0 != main_~p2~0#1); 606#L160-1 assume !(0 != main_~p3~0#1); 604#L165-1 assume !(0 != main_~p4~0#1); 599#L170-1 assume !(0 != main_~p5~0#1); 590#L175-1 assume !(0 != main_~p6~0#1); 582#L180-1 assume !(0 != main_~p7~0#1); 577#L185-1 assume !(0 != main_~p8~0#1); 572#L190-1 assume !(0 != main_~p9~0#1); 570#L195-1 assume !(0 != main_~p10~0#1); 564#L200-1 assume !(0 != main_~p11~0#1); 560#L205-1 assume !(0 != main_~p12~0#1); 552#L210-1 assume !(0 != main_~p13~0#1); 548#L215-1 assume !(0 != main_~p14~0#1); 546#L220-1 assume !(0 != main_~p15~0#1); 498#L225-1 [2024-10-15 00:23:07,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-15 00:23:07,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:07,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6346763] [2024-10-15 00:23:07,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:07,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:08,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:08,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:08,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash -821578554, now seen corresponding path program 1 times [2024-10-15 00:23:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:08,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048278637] [2024-10-15 00:23:08,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:08,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048278637] [2024-10-15 00:23:08,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048278637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:08,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:08,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297127268] [2024-10-15 00:23:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:08,058 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:08,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:08,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:08,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:08,059 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. cyclomatic complexity: 116 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-10-15 00:23:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:08,078 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2024-10-15 00:23:08,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 582 transitions. [2024-10-15 00:23:08,082 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2024-10-15 00:23:08,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 582 transitions. [2024-10-15 00:23:08,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2024-10-15 00:23:08,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2024-10-15 00:23:08,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 582 transitions. [2024-10-15 00:23:08,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:08,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 366 states and 582 transitions. [2024-10-15 00:23:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 582 transitions. [2024-10-15 00:23:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-10-15 00:23:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.5901639344262295) internal successors, (582), 365 states have internal predecessors, (582), 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-10-15 00:23:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2024-10-15 00:23:08,103 INFO L240 hiAutomatonCegarLoop]: Abstraction has 366 states and 582 transitions. [2024-10-15 00:23:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:08,104 INFO L425 stractBuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2024-10-15 00:23:08,105 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:23:08,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 582 transitions. [2024-10-15 00:23:08,107 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2024-10-15 00:23:08,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:08,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:08,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:08,108 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-10-15 00:23:08,108 INFO L745 eck$LassoCheckResult]: Stem: 1049#$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); 1050#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1056#L225-1 [2024-10-15 00:23:08,109 INFO L747 eck$LassoCheckResult]: Loop: 1056#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1133#L58 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;main_~lk15~0#1 := 0; 1129#L93 assume !(0 != main_~p1~0#1); 1123#L93-2 assume !(0 != main_~p2~0#1); 1120#L97-1 assume !(0 != main_~p3~0#1); 1114#L101-1 assume !(0 != main_~p4~0#1); 1115#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1259#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1257#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1255#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1253#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1251#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1249#L129-1 assume !(0 != main_~p11~0#1); 1247#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1246#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1243#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1241#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1239#L149-1 assume !(0 != main_~p1~0#1); 1238#L155-1 assume !(0 != main_~p2~0#1); 1237#L160-1 assume !(0 != main_~p3~0#1); 1233#L165-1 assume !(0 != main_~p4~0#1); 1234#L170-1 assume !(0 != main_~p5~0#1); 1228#L175-1 assume !(0 != main_~p6~0#1); 1220#L180-1 assume !(0 != main_~p7~0#1); 1196#L185-1 assume !(0 != main_~p8~0#1); 1171#L190-1 assume !(0 != main_~p9~0#1); 1169#L195-1 assume !(0 != main_~p10~0#1); 1167#L200-1 assume !(0 != main_~p11~0#1); 1165#L205-1 assume !(0 != main_~p12~0#1); 1163#L210-1 assume !(0 != main_~p13~0#1); 1147#L215-1 assume !(0 != main_~p14~0#1); 1143#L220-1 assume !(0 != main_~p15~0#1); 1056#L225-1 [2024-10-15 00:23:08,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-15 00:23:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:08,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55174359] [2024-10-15 00:23:08,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:08,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:08,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:08,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:08,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1101649480, now seen corresponding path program 1 times [2024-10-15 00:23:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:08,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496417923] [2024-10-15 00:23:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:08,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:08,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:08,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496417923] [2024-10-15 00:23:08,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496417923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:08,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:08,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:08,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641687154] [2024-10-15 00:23:08,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:08,157 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:08,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:08,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:08,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:08,158 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. cyclomatic complexity: 224 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-10-15 00:23:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:08,175 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2024-10-15 00:23:08,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1138 transitions. [2024-10-15 00:23:08,182 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2024-10-15 00:23:08,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1138 transitions. [2024-10-15 00:23:08,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2024-10-15 00:23:08,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2024-10-15 00:23:08,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1138 transitions. [2024-10-15 00:23:08,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:08,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 722 states and 1138 transitions. [2024-10-15 00:23:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1138 transitions. [2024-10-15 00:23:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2024-10-15 00:23:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5761772853185596) internal successors, (1138), 721 states have internal predecessors, (1138), 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-10-15 00:23:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1138 transitions. [2024-10-15 00:23:08,214 INFO L240 hiAutomatonCegarLoop]: Abstraction has 722 states and 1138 transitions. [2024-10-15 00:23:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:08,215 INFO L425 stractBuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2024-10-15 00:23:08,216 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:23:08,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1138 transitions. [2024-10-15 00:23:08,219 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2024-10-15 00:23:08,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:08,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:08,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:08,221 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-10-15 00:23:08,221 INFO L745 eck$LassoCheckResult]: Stem: 2146#$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); 2147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2113#L225-1 [2024-10-15 00:23:08,221 INFO L747 eck$LassoCheckResult]: Loop: 2113#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2152#L58 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;main_~lk15~0#1 := 0; 2153#L93 assume !(0 != main_~p1~0#1); 2564#L93-2 assume !(0 != main_~p2~0#1); 2558#L97-1 assume !(0 != main_~p3~0#1); 2526#L101-1 assume !(0 != main_~p4~0#1); 2528#L105-1 assume !(0 != main_~p5~0#1); 2556#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2554#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2552#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2550#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2548#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2546#L129-1 assume !(0 != main_~p11~0#1); 2544#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2542#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2540#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2538#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2536#L149-1 assume !(0 != main_~p1~0#1); 2490#L155-1 assume !(0 != main_~p2~0#1); 2491#L160-1 assume !(0 != main_~p3~0#1); 2623#L165-1 assume !(0 != main_~p4~0#1); 2482#L170-1 assume !(0 != main_~p5~0#1); 2479#L175-1 assume !(0 != main_~p6~0#1); 2478#L180-1 assume !(0 != main_~p7~0#1); 2158#L185-1 assume !(0 != main_~p8~0#1); 2117#L190-1 assume !(0 != main_~p9~0#1); 2628#L195-1 assume !(0 != main_~p10~0#1); 2124#L200-1 assume !(0 != main_~p11~0#1); 2125#L205-1 assume !(0 != main_~p12~0#1); 2140#L210-1 assume !(0 != main_~p13~0#1); 2108#L215-1 assume !(0 != main_~p14~0#1); 2109#L220-1 assume !(0 != main_~p15~0#1); 2113#L225-1 [2024-10-15 00:23:08,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-15 00:23:08,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:08,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568549233] [2024-10-15 00:23:08,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:08,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:08,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:08,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:08,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:08,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1163689094, now seen corresponding path program 1 times [2024-10-15 00:23:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:08,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597408740] [2024-10-15 00:23:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:08,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:08,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597408740] [2024-10-15 00:23:08,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597408740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:08,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:08,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:08,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870920510] [2024-10-15 00:23:08,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:08,270 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:08,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:08,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:08,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:08,271 INFO L87 Difference]: Start difference. First operand 722 states and 1138 transitions. cyclomatic complexity: 432 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-10-15 00:23:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:08,289 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2024-10-15 00:23:08,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2226 transitions. [2024-10-15 00:23:08,300 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2024-10-15 00:23:08,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2226 transitions. [2024-10-15 00:23:08,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2024-10-15 00:23:08,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2024-10-15 00:23:08,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2226 transitions. [2024-10-15 00:23:08,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:08,312 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2024-10-15 00:23:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2226 transitions. [2024-10-15 00:23:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2024-10-15 00:23:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5610098176718092) internal successors, (2226), 1425 states have internal predecessors, (2226), 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-10-15 00:23:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2226 transitions. [2024-10-15 00:23:08,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2024-10-15 00:23:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:08,341 INFO L425 stractBuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2024-10-15 00:23:08,341 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:23:08,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2226 transitions. [2024-10-15 00:23:08,347 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2024-10-15 00:23:08,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:08,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:08,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:08,349 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-10-15 00:23:08,349 INFO L745 eck$LassoCheckResult]: Stem: 4300#$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); 4301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4307#L225-1 [2024-10-15 00:23:08,349 INFO L747 eck$LassoCheckResult]: Loop: 4307#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4522#L58 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;main_~lk15~0#1 := 0; 4523#L93 assume !(0 != main_~p1~0#1); 4733#L93-2 assume !(0 != main_~p2~0#1); 4732#L97-1 assume !(0 != main_~p3~0#1); 4730#L101-1 assume !(0 != main_~p4~0#1); 4727#L105-1 assume !(0 != main_~p5~0#1); 4723#L109-1 assume !(0 != main_~p6~0#1); 4721#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4719#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4717#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4715#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4713#L129-1 assume !(0 != main_~p11~0#1); 4711#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4709#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4707#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4705#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4702#L149-1 assume !(0 != main_~p1~0#1); 4703#L155-1 assume !(0 != main_~p2~0#1); 4752#L160-1 assume !(0 != main_~p3~0#1); 4651#L165-1 assume !(0 != main_~p4~0#1); 4652#L170-1 assume !(0 != main_~p5~0#1); 4639#L175-1 assume !(0 != main_~p6~0#1); 4641#L180-1 assume !(0 != main_~p7~0#1); 4625#L185-1 assume !(0 != main_~p8~0#1); 4626#L190-1 assume !(0 != main_~p9~0#1); 4612#L195-1 assume !(0 != main_~p10~0#1); 4611#L200-1 assume !(0 != main_~p11~0#1); 4596#L205-1 assume !(0 != main_~p12~0#1); 4588#L210-1 assume !(0 != main_~p13~0#1); 4587#L215-1 assume !(0 != main_~p14~0#1); 4543#L220-1 assume !(0 != main_~p15~0#1); 4307#L225-1 [2024-10-15 00:23:08,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-10-15 00:23:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:08,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502739432] [2024-10-15 00:23:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:08,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:08,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:08,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1304237704, now seen corresponding path program 1 times [2024-10-15 00:23:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:08,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065220552] [2024-10-15 00:23:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:08,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065220552] [2024-10-15 00:23:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065220552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:08,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:08,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206030340] [2024-10-15 00:23:08,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:08,392 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:08,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:08,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:08,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:08,393 INFO L87 Difference]: Start difference. First operand 1426 states and 2226 transitions. cyclomatic complexity: 832 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-10-15 00:23:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:08,414 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2024-10-15 00:23:08,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4354 transitions. [2024-10-15 00:23:08,436 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2024-10-15 00:23:08,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4354 transitions. [2024-10-15 00:23:08,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2024-10-15 00:23:08,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2024-10-15 00:23:08,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4354 transitions. [2024-10-15 00:23:08,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:08,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2024-10-15 00:23:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4354 transitions. [2024-10-15 00:23:08,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2024-10-15 00:23:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.5450674237047552) internal successors, (4354), 2817 states have internal predecessors, (4354), 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-10-15 00:23:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4354 transitions. [2024-10-15 00:23:08,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2024-10-15 00:23:08,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:08,561 INFO L425 stractBuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2024-10-15 00:23:08,561 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:23:08,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4354 transitions. [2024-10-15 00:23:08,581 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2024-10-15 00:23:08,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:08,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:08,584 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:08,584 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-10-15 00:23:08,584 INFO L745 eck$LassoCheckResult]: Stem: 8551#$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); 8552#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8558#L225-1 [2024-10-15 00:23:08,585 INFO L747 eck$LassoCheckResult]: Loop: 8558#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8715#L58 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;main_~lk15~0#1 := 0; 8713#L93 assume !(0 != main_~p1~0#1); 8712#L93-2 assume !(0 != main_~p2~0#1); 8706#L97-1 assume !(0 != main_~p3~0#1); 8707#L101-1 assume !(0 != main_~p4~0#1); 8813#L105-1 assume !(0 != main_~p5~0#1); 8810#L109-1 assume !(0 != main_~p6~0#1); 8806#L113-1 assume !(0 != main_~p7~0#1); 8804#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8803#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8800#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8797#L129-1 assume !(0 != main_~p11~0#1); 8794#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8790#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8786#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8781#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8775#L149-1 assume !(0 != main_~p1~0#1); 8769#L155-1 assume !(0 != main_~p2~0#1); 8764#L160-1 assume !(0 != main_~p3~0#1); 8757#L165-1 assume !(0 != main_~p4~0#1); 8751#L170-1 assume !(0 != main_~p5~0#1); 8746#L175-1 assume !(0 != main_~p6~0#1); 8744#L180-1 assume !(0 != main_~p7~0#1); 8738#L185-1 assume !(0 != main_~p8~0#1); 8735#L190-1 assume !(0 != main_~p9~0#1); 8731#L195-1 assume !(0 != main_~p10~0#1); 8725#L200-1 assume !(0 != main_~p11~0#1); 8723#L205-1 assume !(0 != main_~p12~0#1); 8721#L210-1 assume !(0 != main_~p13~0#1); 8719#L215-1 assume !(0 != main_~p14~0#1); 8717#L220-1 assume !(0 != main_~p15~0#1); 8558#L225-1 [2024-10-15 00:23:08,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:08,585 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-10-15 00:23:08,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:08,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033007912] [2024-10-15 00:23:08,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:08,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:08,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:08,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:08,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1170224198, now seen corresponding path program 1 times [2024-10-15 00:23:08,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:08,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746773661] [2024-10-15 00:23:08,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:08,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:08,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:08,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746773661] [2024-10-15 00:23:08,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746773661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:08,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:08,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:08,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136048019] [2024-10-15 00:23:08,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:08,650 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:08,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:08,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:08,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:08,653 INFO L87 Difference]: Start difference. First operand 2818 states and 4354 transitions. cyclomatic complexity: 1600 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-10-15 00:23:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:08,689 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2024-10-15 00:23:08,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8514 transitions. [2024-10-15 00:23:08,737 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2024-10-15 00:23:08,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8514 transitions. [2024-10-15 00:23:08,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2024-10-15 00:23:08,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2024-10-15 00:23:08,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8514 transitions. [2024-10-15 00:23:08,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:08,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2024-10-15 00:23:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8514 transitions. [2024-10-15 00:23:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2024-10-15 00:23:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.5285457809694794) internal successors, (8514), 5569 states have internal predecessors, (8514), 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-10-15 00:23:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8514 transitions. [2024-10-15 00:23:08,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2024-10-15 00:23:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:08,912 INFO L425 stractBuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2024-10-15 00:23:08,912 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:23:08,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8514 transitions. [2024-10-15 00:23:08,936 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2024-10-15 00:23:08,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:08,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:08,937 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:08,937 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-10-15 00:23:08,938 INFO L745 eck$LassoCheckResult]: Stem: 16942#$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); 16943#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16950#L225-1 [2024-10-15 00:23:08,938 INFO L747 eck$LassoCheckResult]: Loop: 16950#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17204#L58 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;main_~lk15~0#1 := 0; 17198#L93 assume !(0 != main_~p1~0#1); 17194#L93-2 assume !(0 != main_~p2~0#1); 17191#L97-1 assume !(0 != main_~p3~0#1); 17185#L101-1 assume !(0 != main_~p4~0#1); 17179#L105-1 assume !(0 != main_~p5~0#1); 17175#L109-1 assume !(0 != main_~p6~0#1); 17170#L113-1 assume !(0 != main_~p7~0#1); 17164#L117-1 assume !(0 != main_~p8~0#1); 17165#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 17152#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17153#L129-1 assume !(0 != main_~p11~0#1); 17144#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17145#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17136#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17137#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17126#L149-1 assume !(0 != main_~p1~0#1); 17127#L155-1 assume !(0 != main_~p2~0#1); 17116#L160-1 assume !(0 != main_~p3~0#1); 17115#L165-1 assume !(0 != main_~p4~0#1); 17102#L170-1 assume !(0 != main_~p5~0#1); 17103#L175-1 assume !(0 != main_~p6~0#1); 17093#L180-1 assume !(0 != main_~p7~0#1); 17094#L185-1 assume !(0 != main_~p8~0#1); 17246#L190-1 assume !(0 != main_~p9~0#1); 17242#L195-1 assume !(0 != main_~p10~0#1); 17238#L200-1 assume !(0 != main_~p11~0#1); 17232#L205-1 assume !(0 != main_~p12~0#1); 17226#L210-1 assume !(0 != main_~p13~0#1); 17220#L215-1 assume !(0 != main_~p14~0#1); 17214#L220-1 assume !(0 != main_~p15~0#1); 16950#L225-1 [2024-10-15 00:23:08,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-10-15 00:23:08,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:08,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737453167] [2024-10-15 00:23:08,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:08,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:09,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:09,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:09,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash -635214136, now seen corresponding path program 1 times [2024-10-15 00:23:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:09,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438523097] [2024-10-15 00:23:09,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:09,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:09,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438523097] [2024-10-15 00:23:09,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438523097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:09,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293769556] [2024-10-15 00:23:09,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:09,058 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:09,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:09,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:09,059 INFO L87 Difference]: Start difference. First operand 5570 states and 8514 transitions. cyclomatic complexity: 3072 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-10-15 00:23:09,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:09,115 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2024-10-15 00:23:09,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16642 transitions. [2024-10-15 00:23:09,182 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2024-10-15 00:23:09,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16642 transitions. [2024-10-15 00:23:09,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2024-10-15 00:23:09,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2024-10-15 00:23:09,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16642 transitions. [2024-10-15 00:23:09,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:09,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2024-10-15 00:23:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16642 transitions. [2024-10-15 00:23:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2024-10-15 00:23:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.5115349682107175) internal successors, (16642), 11009 states have internal predecessors, (16642), 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-10-15 00:23:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16642 transitions. [2024-10-15 00:23:09,678 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2024-10-15 00:23:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:09,683 INFO L425 stractBuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2024-10-15 00:23:09,684 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:23:09,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16642 transitions. [2024-10-15 00:23:09,724 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2024-10-15 00:23:09,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:09,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:09,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:09,725 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-10-15 00:23:09,726 INFO L745 eck$LassoCheckResult]: Stem: 33526#$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); 33527#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33531#L225-1 [2024-10-15 00:23:09,726 INFO L747 eck$LassoCheckResult]: Loop: 33531#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33939#L58 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;main_~lk15~0#1 := 0; 33933#L93 assume !(0 != main_~p1~0#1); 33809#L93-2 assume !(0 != main_~p2~0#1); 33799#L97-1 assume !(0 != main_~p3~0#1); 33791#L101-1 assume !(0 != main_~p4~0#1); 33780#L105-1 assume !(0 != main_~p5~0#1); 33770#L109-1 assume !(0 != main_~p6~0#1); 33763#L113-1 assume !(0 != main_~p7~0#1); 33759#L117-1 assume !(0 != main_~p8~0#1); 33754#L121-1 assume !(0 != main_~p9~0#1); 33750#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 33747#L129-1 assume !(0 != main_~p11~0#1); 33744#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 33741#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 33737#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 33738#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 33970#L149-1 assume !(0 != main_~p1~0#1); 33966#L155-1 assume !(0 != main_~p2~0#1); 33963#L160-1 assume !(0 != main_~p3~0#1); 33958#L165-1 assume !(0 != main_~p4~0#1); 33944#L170-1 assume !(0 != main_~p5~0#1); 33934#L175-1 assume !(0 != main_~p6~0#1); 33936#L180-1 assume !(0 != main_~p7~0#1); 34036#L185-1 assume !(0 != main_~p8~0#1); 34034#L190-1 assume !(0 != main_~p9~0#1); 34033#L195-1 assume !(0 != main_~p10~0#1); 34031#L200-1 assume !(0 != main_~p11~0#1); 34029#L205-1 assume !(0 != main_~p12~0#1); 34027#L210-1 assume !(0 != main_~p13~0#1); 33978#L215-1 assume !(0 != main_~p14~0#1); 33955#L220-1 assume !(0 != main_~p15~0#1); 33531#L225-1 [2024-10-15 00:23:09,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:09,727 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-10-15 00:23:09,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:09,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646882535] [2024-10-15 00:23:09,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:09,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:09,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:09,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:09,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash -416359418, now seen corresponding path program 1 times [2024-10-15 00:23:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978102048] [2024-10-15 00:23:09,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:09,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:09,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978102048] [2024-10-15 00:23:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978102048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:09,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:09,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:09,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633113222] [2024-10-15 00:23:09,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:09,759 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:09,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:09,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:09,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:09,760 INFO L87 Difference]: Start difference. First operand 11010 states and 16642 transitions. cyclomatic complexity: 5888 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-10-15 00:23:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:09,837 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2024-10-15 00:23:09,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 32514 transitions. [2024-10-15 00:23:10,149 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2024-10-15 00:23:10,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 32514 transitions. [2024-10-15 00:23:10,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2024-10-15 00:23:10,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2024-10-15 00:23:10,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 32514 transitions. [2024-10-15 00:23:10,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:10,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2024-10-15 00:23:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 32514 transitions. [2024-10-15 00:23:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2024-10-15 00:23:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.4940722360077199) internal successors, (32514), 21761 states have internal predecessors, (32514), 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-10-15 00:23:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 32514 transitions. [2024-10-15 00:23:10,800 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2024-10-15 00:23:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:10,802 INFO L425 stractBuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2024-10-15 00:23:10,802 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:23:10,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 32514 transitions. [2024-10-15 00:23:11,010 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2024-10-15 00:23:11,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:11,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:11,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:11,012 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-10-15 00:23:11,012 INFO L745 eck$LassoCheckResult]: Stem: 66304#$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); 66305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66311#L225-1 [2024-10-15 00:23:11,012 INFO L747 eck$LassoCheckResult]: Loop: 66311#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66961#L58 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;main_~lk15~0#1 := 0; 66959#L93 assume !(0 != main_~p1~0#1); 66957#L93-2 assume !(0 != main_~p2~0#1); 66956#L97-1 assume !(0 != main_~p3~0#1); 66954#L101-1 assume !(0 != main_~p4~0#1); 66952#L105-1 assume !(0 != main_~p5~0#1); 66951#L109-1 assume !(0 != main_~p6~0#1); 66949#L113-1 assume !(0 != main_~p7~0#1); 66947#L117-1 assume !(0 != main_~p8~0#1); 66945#L121-1 assume !(0 != main_~p9~0#1); 66943#L125-1 assume !(0 != main_~p10~0#1); 66941#L129-1 assume !(0 != main_~p11~0#1); 66940#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 66938#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66935#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66905#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66900#L149-1 assume !(0 != main_~p1~0#1); 66897#L155-1 assume !(0 != main_~p2~0#1); 66896#L160-1 assume !(0 != main_~p3~0#1); 66891#L165-1 assume !(0 != main_~p4~0#1); 66705#L170-1 assume !(0 != main_~p5~0#1); 66706#L175-1 assume !(0 != main_~p6~0#1); 66697#L180-1 assume !(0 != main_~p7~0#1); 66698#L185-1 assume !(0 != main_~p8~0#1); 66833#L190-1 assume !(0 != main_~p9~0#1); 66835#L195-1 assume !(0 != main_~p10~0#1); 66877#L200-1 assume !(0 != main_~p11~0#1); 66872#L205-1 assume !(0 != main_~p12~0#1); 66871#L210-1 assume !(0 != main_~p13~0#1); 66965#L215-1 assume !(0 != main_~p14~0#1); 66963#L220-1 assume !(0 != main_~p15~0#1); 66311#L225-1 [2024-10-15 00:23:11,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-10-15 00:23:11,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:11,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42736638] [2024-10-15 00:23:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:11,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:11,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:11,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:11,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash 6342408, now seen corresponding path program 1 times [2024-10-15 00:23:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:11,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657241509] [2024-10-15 00:23:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:11,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:11,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:11,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657241509] [2024-10-15 00:23:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657241509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:11,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:11,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551175910] [2024-10-15 00:23:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:11,106 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:11,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:11,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:11,111 INFO L87 Difference]: Start difference. First operand 21762 states and 32514 transitions. cyclomatic complexity: 11264 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-10-15 00:23:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:11,657 INFO L93 Difference]: Finished difference Result 43010 states and 63490 transitions. [2024-10-15 00:23:11,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 63490 transitions. [2024-10-15 00:23:11,860 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2024-10-15 00:23:12,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 63490 transitions. [2024-10-15 00:23:12,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2024-10-15 00:23:12,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2024-10-15 00:23:12,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 63490 transitions. [2024-10-15 00:23:12,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:12,235 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2024-10-15 00:23:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 63490 transitions. [2024-10-15 00:23:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2024-10-15 00:23:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4761683329458266) internal successors, (63490), 43009 states have internal predecessors, (63490), 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-10-15 00:23:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 63490 transitions. [2024-10-15 00:23:13,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2024-10-15 00:23:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:13,112 INFO L425 stractBuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2024-10-15 00:23:13,112 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:23:13,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 63490 transitions. [2024-10-15 00:23:13,221 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2024-10-15 00:23:13,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:13,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:13,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:13,222 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-10-15 00:23:13,222 INFO L745 eck$LassoCheckResult]: Stem: 131083#$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); 131084#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131090#L225-1 [2024-10-15 00:23:13,222 INFO L747 eck$LassoCheckResult]: Loop: 131090#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 131931#L58 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;main_~lk15~0#1 := 0; 131932#L93 assume !(0 != main_~p1~0#1); 131905#L93-2 assume !(0 != main_~p2~0#1); 131907#L97-1 assume !(0 != main_~p3~0#1); 131892#L101-1 assume !(0 != main_~p4~0#1); 131894#L105-1 assume !(0 != main_~p5~0#1); 132109#L109-1 assume !(0 != main_~p6~0#1); 132105#L113-1 assume !(0 != main_~p7~0#1); 132101#L117-1 assume !(0 != main_~p8~0#1); 132098#L121-1 assume !(0 != main_~p9~0#1); 132095#L125-1 assume !(0 != main_~p10~0#1); 132092#L129-1 assume !(0 != main_~p11~0#1); 132053#L133-1 assume !(0 != main_~p12~0#1); 132054#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 132056#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 132051#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 132022#L149-1 assume !(0 != main_~p1~0#1); 132023#L155-1 assume !(0 != main_~p2~0#1); 132108#L160-1 assume !(0 != main_~p3~0#1); 132103#L165-1 assume !(0 != main_~p4~0#1); 132100#L170-1 assume !(0 != main_~p5~0#1); 132097#L175-1 assume !(0 != main_~p6~0#1); 132093#L180-1 assume !(0 != main_~p7~0#1); 132091#L185-1 assume !(0 != main_~p8~0#1); 132088#L190-1 assume !(0 != main_~p9~0#1); 132086#L195-1 assume !(0 != main_~p10~0#1); 132083#L200-1 assume !(0 != main_~p11~0#1); 132081#L205-1 assume !(0 != main_~p12~0#1); 132080#L210-1 assume !(0 != main_~p13~0#1); 132078#L215-1 assume !(0 != main_~p14~0#1); 131939#L220-1 assume !(0 != main_~p15~0#1); 131090#L225-1 [2024-10-15 00:23:13,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-10-15 00:23:13,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:13,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968657708] [2024-10-15 00:23:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:13,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:13,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:13,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:13,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1682601334, now seen corresponding path program 1 times [2024-10-15 00:23:13,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:13,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505218780] [2024-10-15 00:23:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:13,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:13,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505218780] [2024-10-15 00:23:13,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505218780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:13,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:13,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:13,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133006256] [2024-10-15 00:23:13,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:13,246 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:13,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:13,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:13,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:13,247 INFO L87 Difference]: Start difference. First operand 43010 states and 63490 transitions. cyclomatic complexity: 21504 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-10-15 00:23:13,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:13,761 INFO L93 Difference]: Finished difference Result 84994 states and 123906 transitions. [2024-10-15 00:23:13,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 123906 transitions. [2024-10-15 00:23:14,469 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2024-10-15 00:23:15,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 123906 transitions. [2024-10-15 00:23:15,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2024-10-15 00:23:15,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2024-10-15 00:23:15,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 123906 transitions. [2024-10-15 00:23:15,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:15,292 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2024-10-15 00:23:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 123906 transitions. [2024-10-15 00:23:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2024-10-15 00:23:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.4578205520389675) internal successors, (123906), 84993 states have internal predecessors, (123906), 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-10-15 00:23:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 123906 transitions. [2024-10-15 00:23:16,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2024-10-15 00:23:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:16,993 INFO L425 stractBuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2024-10-15 00:23:16,993 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 00:23:16,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 123906 transitions. [2024-10-15 00:23:17,335 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2024-10-15 00:23:17,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:17,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:17,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:17,338 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-10-15 00:23:17,338 INFO L745 eck$LassoCheckResult]: Stem: 259091#$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); 259092#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259099#L225-1 [2024-10-15 00:23:17,338 INFO L747 eck$LassoCheckResult]: Loop: 259099#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 259378#L58 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;main_~lk15~0#1 := 0; 259376#L93 assume !(0 != main_~p1~0#1); 259374#L93-2 assume !(0 != main_~p2~0#1); 259373#L97-1 assume !(0 != main_~p3~0#1); 259371#L101-1 assume !(0 != main_~p4~0#1); 259369#L105-1 assume !(0 != main_~p5~0#1); 259367#L109-1 assume !(0 != main_~p6~0#1); 259365#L113-1 assume !(0 != main_~p7~0#1); 259363#L117-1 assume !(0 != main_~p8~0#1); 259361#L121-1 assume !(0 != main_~p9~0#1); 259238#L125-1 assume !(0 != main_~p10~0#1); 259184#L129-1 assume !(0 != main_~p11~0#1); 259185#L133-1 assume !(0 != main_~p12~0#1); 259359#L137-1 assume !(0 != main_~p13~0#1); 259356#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 259354#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 259351#L149-1 assume !(0 != main_~p1~0#1); 259347#L155-1 assume !(0 != main_~p2~0#1); 259344#L160-1 assume !(0 != main_~p3~0#1); 259339#L165-1 assume !(0 != main_~p4~0#1); 259335#L170-1 assume !(0 != main_~p5~0#1); 259330#L175-1 assume !(0 != main_~p6~0#1); 259324#L180-1 assume !(0 != main_~p7~0#1); 259319#L185-1 assume !(0 != main_~p8~0#1); 259313#L190-1 assume !(0 != main_~p9~0#1); 259307#L195-1 assume !(0 != main_~p10~0#1); 259235#L200-1 assume !(0 != main_~p11~0#1); 259234#L205-1 assume !(0 != main_~p12~0#1); 259297#L210-1 assume !(0 != main_~p13~0#1); 259382#L215-1 assume !(0 != main_~p14~0#1); 259380#L220-1 assume !(0 != main_~p15~0#1); 259099#L225-1 [2024-10-15 00:23:17,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2024-10-15 00:23:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:17,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247410089] [2024-10-15 00:23:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:17,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:17,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:17,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:17,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash 618221256, now seen corresponding path program 1 times [2024-10-15 00:23:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:17,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405288548] [2024-10-15 00:23:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:17,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:17,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405288548] [2024-10-15 00:23:17,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405288548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:17,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:17,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:17,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057557788] [2024-10-15 00:23:17,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:17,368 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:17,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:17,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:17,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:17,369 INFO L87 Difference]: Start difference. First operand 84994 states and 123906 transitions. cyclomatic complexity: 40960 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-10-15 00:23:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:18,908 INFO L93 Difference]: Finished difference Result 167938 states and 241666 transitions. [2024-10-15 00:23:18,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167938 states and 241666 transitions. [2024-10-15 00:23:19,927 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2024-10-15 00:23:20,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167938 states to 167938 states and 241666 transitions. [2024-10-15 00:23:20,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167938 [2024-10-15 00:23:21,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167938 [2024-10-15 00:23:21,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167938 states and 241666 transitions. [2024-10-15 00:23:21,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:21,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2024-10-15 00:23:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167938 states and 241666 transitions. [2024-10-15 00:23:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167938 to 167938. [2024-10-15 00:23:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167938 states, 167938 states have (on average 1.4390191618335337) internal successors, (241666), 167937 states have internal predecessors, (241666), 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-10-15 00:23:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167938 states to 167938 states and 241666 transitions. [2024-10-15 00:23:24,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2024-10-15 00:23:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:24,076 INFO L425 stractBuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2024-10-15 00:23:24,076 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-15 00:23:24,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167938 states and 241666 transitions. [2024-10-15 00:23:25,476 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2024-10-15 00:23:25,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:25,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:25,483 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:25,484 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-10-15 00:23:25,484 INFO L745 eck$LassoCheckResult]: Stem: 512033#$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); 512034#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 512043#L225-1 [2024-10-15 00:23:25,487 INFO L747 eck$LassoCheckResult]: Loop: 512043#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 513169#L58 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;main_~lk15~0#1 := 0; 513166#L93 assume !(0 != main_~p1~0#1); 513160#L93-2 assume !(0 != main_~p2~0#1); 513155#L97-1 assume !(0 != main_~p3~0#1); 513152#L101-1 assume !(0 != main_~p4~0#1); 513149#L105-1 assume !(0 != main_~p5~0#1); 513141#L109-1 assume !(0 != main_~p6~0#1); 513143#L113-1 assume !(0 != main_~p7~0#1); 513131#L117-1 assume !(0 != main_~p8~0#1); 513133#L121-1 assume !(0 != main_~p9~0#1); 513121#L125-1 assume !(0 != main_~p10~0#1); 513123#L129-1 assume !(0 != main_~p11~0#1); 513114#L133-1 assume !(0 != main_~p12~0#1); 513115#L137-1 assume !(0 != main_~p13~0#1); 513091#L141-1 assume !(0 != main_~p14~0#1); 513089#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 513090#L149-1 assume !(0 != main_~p1~0#1); 513250#L155-1 assume !(0 != main_~p2~0#1); 513245#L160-1 assume !(0 != main_~p3~0#1); 513238#L165-1 assume !(0 != main_~p4~0#1); 513232#L170-1 assume !(0 != main_~p5~0#1); 513224#L175-1 assume !(0 != main_~p6~0#1); 513216#L180-1 assume !(0 != main_~p7~0#1); 513208#L185-1 assume !(0 != main_~p8~0#1); 513204#L190-1 assume !(0 != main_~p9~0#1); 513199#L195-1 assume !(0 != main_~p10~0#1); 513194#L200-1 assume !(0 != main_~p11~0#1); 513191#L205-1 assume !(0 != main_~p12~0#1); 513189#L210-1 assume !(0 != main_~p13~0#1); 513186#L215-1 assume !(0 != main_~p14~0#1); 513182#L220-1 assume !(0 != main_~p15~0#1); 512043#L225-1 [2024-10-15 00:23:25,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2024-10-15 00:23:25,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:25,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381327145] [2024-10-15 00:23:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:25,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:25,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:25,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:25,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:25,522 INFO L85 PathProgramCache]: Analyzing trace with hash -970126646, now seen corresponding path program 1 times [2024-10-15 00:23:25,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:25,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915373897] [2024-10-15 00:23:25,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:25,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:25,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915373897] [2024-10-15 00:23:25,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915373897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:25,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:25,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:23:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933438203] [2024-10-15 00:23:25,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:25,581 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:25,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:25,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:25,581 INFO L87 Difference]: Start difference. First operand 167938 states and 241666 transitions. cyclomatic complexity: 77824 Second operand has 3 states, 2 states have (on average 16.0) 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-10-15 00:23:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:26,691 INFO L93 Difference]: Finished difference Result 331778 states and 471042 transitions. [2024-10-15 00:23:26,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331778 states and 471042 transitions. [2024-10-15 00:23:29,594 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2024-10-15 00:23:31,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331778 states to 331778 states and 471042 transitions. [2024-10-15 00:23:31,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331778 [2024-10-15 00:23:31,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331778 [2024-10-15 00:23:31,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331778 states and 471042 transitions. [2024-10-15 00:23:31,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:31,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2024-10-15 00:23:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331778 states and 471042 transitions. [2024-10-15 00:23:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331778 to 331778. [2024-10-15 00:23:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331778 states, 331778 states have (on average 1.419750556094738) internal successors, (471042), 331777 states have internal predecessors, (471042), 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-10-15 00:23:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331778 states to 331778 states and 471042 transitions. [2024-10-15 00:23:37,001 INFO L240 hiAutomatonCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2024-10-15 00:23:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:37,002 INFO L425 stractBuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2024-10-15 00:23:37,003 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-15 00:23:37,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331778 states and 471042 transitions. [2024-10-15 00:23:39,168 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2024-10-15 00:23:39,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:39,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:39,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:39,174 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-10-15 00:23:39,174 INFO L745 eck$LassoCheckResult]: Stem: 1011755#$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); 1011756#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~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_~p15~0#1, main_~lk15~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_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1011761#L225-1 [2024-10-15 00:23:39,174 INFO L747 eck$LassoCheckResult]: Loop: 1011761#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1012022#L58 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;main_~lk15~0#1 := 0; 1012017#L93 assume !(0 != main_~p1~0#1); 1012010#L93-2 assume !(0 != main_~p2~0#1); 1012003#L97-1 assume !(0 != main_~p3~0#1); 1011997#L101-1 assume !(0 != main_~p4~0#1); 1011990#L105-1 assume !(0 != main_~p5~0#1); 1011982#L109-1 assume !(0 != main_~p6~0#1); 1011974#L113-1 assume !(0 != main_~p7~0#1); 1011964#L117-1 assume !(0 != main_~p8~0#1); 1011965#L121-1 assume !(0 != main_~p9~0#1); 1012113#L125-1 assume !(0 != main_~p10~0#1); 1012111#L129-1 assume !(0 != main_~p11~0#1); 1012107#L133-1 assume !(0 != main_~p12~0#1); 1012103#L137-1 assume !(0 != main_~p13~0#1); 1012099#L141-1 assume !(0 != main_~p14~0#1); 1012095#L145-1 assume !(0 != main_~p15~0#1); 1012091#L149-1 assume !(0 != main_~p1~0#1); 1012087#L155-1 assume !(0 != main_~p2~0#1); 1012084#L160-1 assume !(0 != main_~p3~0#1); 1012079#L165-1 assume !(0 != main_~p4~0#1); 1012075#L170-1 assume !(0 != main_~p5~0#1); 1012071#L175-1 assume !(0 != main_~p6~0#1); 1012067#L180-1 assume !(0 != main_~p7~0#1); 1012065#L185-1 assume !(0 != main_~p8~0#1); 1012062#L190-1 assume !(0 != main_~p9~0#1); 1012058#L195-1 assume !(0 != main_~p10~0#1); 1012055#L200-1 assume !(0 != main_~p11~0#1); 1012051#L205-1 assume !(0 != main_~p12~0#1); 1012046#L210-1 assume !(0 != main_~p13~0#1); 1012040#L215-1 assume !(0 != main_~p14~0#1); 1012033#L220-1 assume !(0 != main_~p15~0#1); 1011761#L225-1 [2024-10-15 00:23:39,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:39,174 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2024-10-15 00:23:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:39,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023790558] [2024-10-15 00:23:39,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:39,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:39,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:39,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1991195000, now seen corresponding path program 1 times [2024-10-15 00:23:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:39,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231864833] [2024-10-15 00:23:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:39,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:39,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:39,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:39,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:39,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1845576266, now seen corresponding path program 1 times [2024-10-15 00:23:39,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:39,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325127125] [2024-10-15 00:23:39,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:39,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:39,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:39,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:39,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:39,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:23:39 BoogieIcfgContainer [2024-10-15 00:23:39,991 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:23:39,991 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:23:39,991 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:23:39,992 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:23:39,992 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:23:07" (3/4) ... [2024-10-15 00:23:39,994 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-15 00:23:40,032 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-15 00:23:40,033 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:23:40,033 INFO L158 Benchmark]: Toolchain (without parser) took 34143.18ms. Allocated memory was 176.2MB in the beginning and 13.4GB in the end (delta: 13.2GB). Free memory was 126.1MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2024-10-15 00:23:40,034 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 141.2MB in the beginning and 141.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:23:40,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.77ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 113.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 00:23:40,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.84ms. Allocated memory is still 176.2MB. Free memory was 113.5MB in the beginning and 111.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:23:40,034 INFO L158 Benchmark]: Boogie Preprocessor took 66.49ms. Allocated memory is still 176.2MB. Free memory was 111.4MB in the beginning and 109.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:23:40,034 INFO L158 Benchmark]: RCFGBuilder took 636.66ms. Allocated memory is still 176.2MB. Free memory was 109.3MB in the beginning and 91.1MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-15 00:23:40,035 INFO L158 Benchmark]: BuchiAutomizer took 32920.22ms. Allocated memory was 176.2MB in the beginning and 13.4GB in the end (delta: 13.2GB). Free memory was 91.1MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2024-10-15 00:23:40,035 INFO L158 Benchmark]: Witness Printer took 41.50ms. Allocated memory is still 13.4GB. Free memory was 10.3GB in the beginning and 10.3GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:23:40,036 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.10ms. Allocated memory is still 176.2MB. Free memory was 141.2MB in the beginning and 141.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.77ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 113.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.84ms. Allocated memory is still 176.2MB. Free memory was 113.5MB in the beginning and 111.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.49ms. Allocated memory is still 176.2MB. Free memory was 111.4MB in the beginning and 109.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 636.66ms. Allocated memory is still 176.2MB. Free memory was 109.3MB in the beginning and 91.1MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 32920.22ms. Allocated memory was 176.2MB in the beginning and 13.4GB in the end (delta: 13.2GB). Free memory was 91.1MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 41.50ms. Allocated memory is still 13.4GB. Free memory was 10.3GB in the beginning and 10.3GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 331778 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 32.8s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 26.1s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 12.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 9.2s Buchi closure took 0.3s. 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, 797 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 797 mSDsluCounter, 2495 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 966 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 1529 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI13 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: 56]: 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; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND FALSE !(p14 != 0) [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND FALSE !(p14 != 0) [L225] COND FALSE !(p15 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: 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; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND FALSE !(p14 != 0) [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND FALSE !(p14 != 0) [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-15 00:23:40,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)