./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_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d 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_7.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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:09:23,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:09:23,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-13 17:09:23,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:09:23,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:09:23,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:09:23,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:09:23,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:09:23,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:09:23,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:09:23,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:09:23,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:09:23,619 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:09:23,619 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:09:23,619 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:09:23,620 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:09:23,620 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:09:23,620 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:09:23,620 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:09:23,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:09:23,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:09:23,622 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 17:09:23,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:09:23,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 17:09:23,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:09:23,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:09:23,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:09:23,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:09:23,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:09:23,623 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:09:23,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 17:09:23,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:09:23,624 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:09:23,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:09:23,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:09:23,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:09:23,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:09:23,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:09:23,625 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:09:23,625 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2024-10-13 17:09:23,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:09:23,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:09:23,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:09:23,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:09:23,836 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:09:23,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2024-10-13 17:09:25,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:09:25,228 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:09:25,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2024-10-13 17:09:25,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abdebb08/145cc28881a047b493c62375d5fd6a28/FLAG888122311 [2024-10-13 17:09:25,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abdebb08/145cc28881a047b493c62375d5fd6a28 [2024-10-13 17:09:25,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:09:25,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:09:25,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:09:25,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:09:25,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:09:25,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b45d1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25, skipping insertion in model container [2024-10-13 17:09:25,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:09:25,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:09:25,825 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:09:25,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:09:25,882 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:09:25,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25 WrapperNode [2024-10-13 17:09:25,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:09:25,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:09:25,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:09:25,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:09:25,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,926 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2024-10-13 17:09:25,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:09:25,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:09:25,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:09:25,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:09:25,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,945 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-13 17:09:25,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:09:25,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:09:25,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:09:25,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:09:25,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (1/1) ... [2024-10-13 17:09:25,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:09:25,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:09:25,979 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-13 17:09:25,981 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-13 17:09:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 17:09:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:09:26,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:09:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 17:09:26,063 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:09:26,064 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:09:26,202 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 17:09:26,202 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:09:26,215 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:09:26,215 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 17:09:26,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:09:26 BoogieIcfgContainer [2024-10-13 17:09:26,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:09:26,218 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:09:26,218 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:09:26,221 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:09:26,222 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:09:26,222 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:09:25" (1/3) ... [2024-10-13 17:09:26,223 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e1ed7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:09:26, skipping insertion in model container [2024-10-13 17:09:26,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:09:26,223 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:09:25" (2/3) ... [2024-10-13 17:09:26,224 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e1ed7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:09:26, skipping insertion in model container [2024-10-13 17:09:26,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:09:26,224 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:09:26" (3/3) ... [2024-10-13 17:09:26,225 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2024-10-13 17:09:26,271 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:09:26,271 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:09:26,271 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:09:26,271 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:09:26,271 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:09:26,272 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:09:26,272 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:09:26,272 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:09:26,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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-13 17:09:26,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-13 17:09:26,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:09:26,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:09:26,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:09:26,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:09:26,293 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:09:26,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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-13 17:09:26,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-13 17:09:26,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:09:26,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:09:26,295 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:09:26,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:09:26,301 INFO L745 eck$LassoCheckResult]: Stem: 29#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 5#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_~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_~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_~cond~0#1; 17#L113-1true [2024-10-13 17:09:26,302 INFO L747 eck$LassoCheckResult]: Loop: 17#L113-1true assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 27#L34true 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; 30#L53true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L53-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 13#L57-1true assume !(0 != main_~p3~0#1); 9#L61-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 24#L65-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 26#L69-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L73-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 23#L77-1true assume !(0 != main_~p1~0#1); 31#L83-1true assume !(0 != main_~p2~0#1); 15#L88-1true assume !(0 != main_~p3~0#1); 10#L93-1true assume !(0 != main_~p4~0#1); 16#L98-1true assume !(0 != main_~p5~0#1); 7#L103-1true assume !(0 != main_~p6~0#1); 14#L108-1true assume !(0 != main_~p7~0#1); 17#L113-1true [2024-10-13 17:09:26,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 17:09:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900724339] [2024-10-13 17:09:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:09:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:09:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2024-10-13 17:09:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752694660] [2024-10-13 17:09:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:09:26,484 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-13 17:09:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:09:26,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752694660] [2024-10-13 17:09:26,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752694660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:09:26,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:09:26,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:09:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161248957] [2024-10-13 17:09:26,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:09:26,488 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:09:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:09:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:09:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:09:26,512 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-13 17:09:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:09:26,542 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2024-10-13 17:09:26,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 93 transitions. [2024-10-13 17:09:26,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2024-10-13 17:09:26,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 47 states and 73 transitions. [2024-10-13 17:09:26,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-10-13 17:09:26,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-10-13 17:09:26,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2024-10-13 17:09:26,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:09:26,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2024-10-13 17:09:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2024-10-13 17:09:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-13 17:09:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 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-13 17:09:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2024-10-13 17:09:26,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2024-10-13 17:09:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:09:26,580 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2024-10-13 17:09:26,581 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:09:26,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2024-10-13 17:09:26,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2024-10-13 17:09:26,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:09:26,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:09:26,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:09:26,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:09:26,582 INFO L745 eck$LassoCheckResult]: Stem: 120#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 99#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_~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_~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_~cond~0#1; 100#L113-1 [2024-10-13 17:09:26,583 INFO L747 eck$LassoCheckResult]: Loop: 100#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 115#L34 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; 119#L53 assume !(0 != main_~p1~0#1); 122#L53-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 141#L57-1 assume !(0 != main_~p3~0#1); 140#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 139#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 138#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 137#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 136#L77-1 assume !(0 != main_~p1~0#1); 135#L83-1 assume !(0 != main_~p2~0#1); 133#L88-1 assume !(0 != main_~p3~0#1); 131#L93-1 assume !(0 != main_~p4~0#1); 128#L98-1 assume !(0 != main_~p5~0#1); 103#L103-1 assume !(0 != main_~p6~0#1); 105#L108-1 assume !(0 != main_~p7~0#1); 100#L113-1 [2024-10-13 17:09:26,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,583 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-13 17:09:26,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563158744] [2024-10-13 17:09:26,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:09:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:09:26,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2024-10-13 17:09:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582349581] [2024-10-13 17:09:26,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:09:26,643 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-13 17:09:26,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:09:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582349581] [2024-10-13 17:09:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582349581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:09:26,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:09:26,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:09:26,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261527512] [2024-10-13 17:09:26,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:09:26,644 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:09:26,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:09:26,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:09:26,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:09:26,645 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-13 17:09:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:09:26,658 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2024-10-13 17:09:26,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2024-10-13 17:09:26,660 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2024-10-13 17:09:26,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2024-10-13 17:09:26,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2024-10-13 17:09:26,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2024-10-13 17:09:26,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2024-10-13 17:09:26,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:09:26,662 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-10-13 17:09:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2024-10-13 17:09:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 17:09:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 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-13 17:09:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2024-10-13 17:09:26,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-10-13 17:09:26,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:09:26,673 INFO L425 stractBuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-10-13 17:09:26,673 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:09:26,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2024-10-13 17:09:26,674 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2024-10-13 17:09:26,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:09:26,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:09:26,674 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:09:26,674 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:09:26,675 INFO L745 eck$LassoCheckResult]: Stem: 272#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 242#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_~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_~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_~cond~0#1; 243#L113-1 [2024-10-13 17:09:26,675 INFO L747 eck$LassoCheckResult]: Loop: 243#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 289#L34 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; 290#L53 assume !(0 != main_~p1~0#1); 305#L53-2 assume !(0 != main_~p2~0#1); 254#L57-1 assume !(0 != main_~p3~0#1); 249#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 250#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 268#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 269#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 297#L77-1 assume !(0 != main_~p1~0#1); 274#L83-1 assume !(0 != main_~p2~0#1); 257#L88-1 assume !(0 != main_~p3~0#1); 259#L93-1 assume !(0 != main_~p4~0#1); 260#L98-1 assume !(0 != main_~p5~0#1); 261#L103-1 assume !(0 != main_~p6~0#1); 308#L108-1 assume !(0 != main_~p7~0#1); 243#L113-1 [2024-10-13 17:09:26,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-13 17:09:26,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507345102] [2024-10-13 17:09:26,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:09:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:09:26,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2024-10-13 17:09:26,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721570470] [2024-10-13 17:09:26,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:09:26,727 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-13 17:09:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:09:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721570470] [2024-10-13 17:09:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721570470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:09:26,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:09:26,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:09:26,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233483306] [2024-10-13 17:09:26,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:09:26,729 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:09:26,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:09:26,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:09:26,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:09:26,730 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-13 17:09:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:09:26,744 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2024-10-13 17:09:26,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2024-10-13 17:09:26,746 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2024-10-13 17:09:26,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2024-10-13 17:09:26,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2024-10-13 17:09:26,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2024-10-13 17:09:26,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2024-10-13 17:09:26,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:09:26,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-10-13 17:09:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2024-10-13 17:09:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-10-13 17:09:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 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-13 17:09:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2024-10-13 17:09:26,756 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-10-13 17:09:26,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:09:26,757 INFO L425 stractBuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-10-13 17:09:26,757 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:09:26,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2024-10-13 17:09:26,759 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2024-10-13 17:09:26,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:09:26,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:09:26,760 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:09:26,760 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:09:26,760 INFO L745 eck$LassoCheckResult]: Stem: 540#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 512#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_~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_~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_~cond~0#1; 513#L113-1 [2024-10-13 17:09:26,760 INFO L747 eck$LassoCheckResult]: Loop: 513#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 574#L34 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; 569#L53 assume !(0 != main_~p1~0#1); 570#L53-2 assume !(0 != main_~p2~0#1); 626#L57-1 assume !(0 != main_~p3~0#1); 623#L61-1 assume !(0 != main_~p4~0#1); 619#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 614#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 610#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 606#L77-1 assume !(0 != main_~p1~0#1); 605#L83-1 assume !(0 != main_~p2~0#1); 604#L88-1 assume !(0 != main_~p3~0#1); 601#L93-1 assume !(0 != main_~p4~0#1); 599#L98-1 assume !(0 != main_~p5~0#1); 598#L103-1 assume !(0 != main_~p6~0#1); 596#L108-1 assume !(0 != main_~p7~0#1); 513#L113-1 [2024-10-13 17:09:26,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-13 17:09:26,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964969353] [2024-10-13 17:09:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:09:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:09:26,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2024-10-13 17:09:26,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288163751] [2024-10-13 17:09:26,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:09:26,791 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-13 17:09:26,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:09:26,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288163751] [2024-10-13 17:09:26,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288163751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:09:26,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:09:26,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:09:26,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196018152] [2024-10-13 17:09:26,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:09:26,792 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:09:26,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:09:26,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:09:26,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:09:26,793 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-13 17:09:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:09:26,815 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2024-10-13 17:09:26,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2024-10-13 17:09:26,819 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2024-10-13 17:09:26,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2024-10-13 17:09:26,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2024-10-13 17:09:26,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2024-10-13 17:09:26,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2024-10-13 17:09:26,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:09:26,823 INFO L218 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2024-10-13 17:09:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2024-10-13 17:09:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-10-13 17:09:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 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-13 17:09:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2024-10-13 17:09:26,840 INFO L240 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2024-10-13 17:09:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:09:26,840 INFO L425 stractBuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2024-10-13 17:09:26,841 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:09:26,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2024-10-13 17:09:26,842 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2024-10-13 17:09:26,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:09:26,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:09:26,843 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:09:26,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:09:26,843 INFO L745 eck$LassoCheckResult]: Stem: 1054#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1030#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_~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_~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_~cond~0#1; 1031#L113-1 [2024-10-13 17:09:26,844 INFO L747 eck$LassoCheckResult]: Loop: 1031#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1076#L34 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; 1077#L53 assume !(0 != main_~p1~0#1); 1130#L53-2 assume !(0 != main_~p2~0#1); 1127#L57-1 assume !(0 != main_~p3~0#1); 1124#L61-1 assume !(0 != main_~p4~0#1); 1122#L65-1 assume !(0 != main_~p5~0#1); 1120#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1117#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1113#L77-1 assume !(0 != main_~p1~0#1); 1109#L83-1 assume !(0 != main_~p2~0#1); 1107#L88-1 assume !(0 != main_~p3~0#1); 1103#L93-1 assume !(0 != main_~p4~0#1); 1100#L98-1 assume !(0 != main_~p5~0#1); 1101#L103-1 assume !(0 != main_~p6~0#1); 1096#L108-1 assume !(0 != main_~p7~0#1); 1031#L113-1 [2024-10-13 17:09:26,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,844 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-13 17:09:26,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231028231] [2024-10-13 17:09:26,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:09:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:09:26,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,854 INFO L85 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2024-10-13 17:09:26,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189700138] [2024-10-13 17:09:26,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:09:26,875 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-13 17:09:26,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:09:26,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189700138] [2024-10-13 17:09:26,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189700138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:09:26,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:09:26,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:09:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602654792] [2024-10-13 17:09:26,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:09:26,877 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:09:26,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:09:26,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:09:26,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:09:26,878 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-13 17:09:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:09:26,896 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2024-10-13 17:09:26,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2024-10-13 17:09:26,901 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2024-10-13 17:09:26,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2024-10-13 17:09:26,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2024-10-13 17:09:26,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2024-10-13 17:09:26,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2024-10-13 17:09:26,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:09:26,910 INFO L218 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2024-10-13 17:09:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2024-10-13 17:09:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2024-10-13 17:09:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 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-13 17:09:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2024-10-13 17:09:26,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2024-10-13 17:09:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:09:26,932 INFO L425 stractBuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2024-10-13 17:09:26,932 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:09:26,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2024-10-13 17:09:26,935 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2024-10-13 17:09:26,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:09:26,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:09:26,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:09:26,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:09:26,936 INFO L745 eck$LassoCheckResult]: Stem: 2062#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 2032#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_~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_~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_~cond~0#1; 2033#L113-1 [2024-10-13 17:09:26,936 INFO L747 eck$LassoCheckResult]: Loop: 2033#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2204#L34 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; 2184#L53 assume !(0 != main_~p1~0#1); 2177#L53-2 assume !(0 != main_~p2~0#1); 2179#L57-1 assume !(0 != main_~p3~0#1); 2355#L61-1 assume !(0 != main_~p4~0#1); 2351#L65-1 assume !(0 != main_~p5~0#1); 2348#L69-1 assume !(0 != main_~p6~0#1); 2346#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2344#L77-1 assume !(0 != main_~p1~0#1); 2342#L83-1 assume !(0 != main_~p2~0#1); 2340#L88-1 assume !(0 != main_~p3~0#1); 2337#L93-1 assume !(0 != main_~p4~0#1); 2336#L98-1 assume !(0 != main_~p5~0#1); 2333#L103-1 assume !(0 != main_~p6~0#1); 2334#L108-1 assume !(0 != main_~p7~0#1); 2033#L113-1 [2024-10-13 17:09:26,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-10-13 17:09:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599733095] [2024-10-13 17:09:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:09:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:26,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:09:26,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:26,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2024-10-13 17:09:26,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:26,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451639394] [2024-10-13 17:09:26,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:26,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:09:26,990 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-13 17:09:26,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:09:26,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451639394] [2024-10-13 17:09:26,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451639394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:09:26,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:09:26,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:09:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54725851] [2024-10-13 17:09:26,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:09:26,991 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:09:26,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:09:26,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:09:26,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:09:26,993 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-13 17:09:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:09:27,011 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2024-10-13 17:09:27,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2024-10-13 17:09:27,017 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2024-10-13 17:09:27,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2024-10-13 17:09:27,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2024-10-13 17:09:27,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2024-10-13 17:09:27,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2024-10-13 17:09:27,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:09:27,024 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2024-10-13 17:09:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2024-10-13 17:09:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2024-10-13 17:09:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 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-13 17:09:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2024-10-13 17:09:27,039 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2024-10-13 17:09:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:09:27,040 INFO L425 stractBuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2024-10-13 17:09:27,041 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:09:27,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2024-10-13 17:09:27,045 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2024-10-13 17:09:27,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:09:27,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:09:27,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:09:27,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:09:27,047 INFO L745 eck$LassoCheckResult]: Stem: 4013#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 3978#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_~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_~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_~cond~0#1; 3979#L113-1 [2024-10-13 17:09:27,047 INFO L747 eck$LassoCheckResult]: Loop: 3979#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 4219#L34 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; 4217#L53 assume !(0 != main_~p1~0#1); 4212#L53-2 assume !(0 != main_~p2~0#1); 4206#L57-1 assume !(0 != main_~p3~0#1); 4201#L61-1 assume !(0 != main_~p4~0#1); 4202#L65-1 assume !(0 != main_~p5~0#1); 4249#L69-1 assume !(0 != main_~p6~0#1); 4247#L73-1 assume !(0 != main_~p7~0#1); 4243#L77-1 assume !(0 != main_~p1~0#1); 4235#L83-1 assume !(0 != main_~p2~0#1); 4234#L88-1 assume !(0 != main_~p3~0#1); 4081#L93-1 assume !(0 != main_~p4~0#1); 4082#L98-1 assume !(0 != main_~p5~0#1); 4226#L103-1 assume !(0 != main_~p6~0#1); 4223#L108-1 assume !(0 != main_~p7~0#1); 3979#L113-1 [2024-10-13 17:09:27,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-10-13 17:09:27,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:27,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887577299] [2024-10-13 17:09:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:27,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:27,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:09:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:27,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:09:27,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:27,058 INFO L85 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2024-10-13 17:09:27,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:27,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167426281] [2024-10-13 17:09:27,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:27,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:27,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:09:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:27,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:09:27,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:09:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2024-10-13 17:09:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:09:27,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415666682] [2024-10-13 17:09:27,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:09:27,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:09:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:27,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:09:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:27,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:09:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:27,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:09:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:09:27,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:09:27 BoogieIcfgContainer [2024-10-13 17:09:27,391 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:09:27,392 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:09:27,392 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:09:27,392 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:09:27,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:09:26" (3/4) ... [2024-10-13 17:09:27,395 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-13 17:09:27,433 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 17:09:27,436 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:09:27,437 INFO L158 Benchmark]: Toolchain (without parser) took 1793.19ms. Allocated memory is still 174.1MB. Free memory was 115.7MB in the beginning and 87.4MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 17:09:27,437 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 51.0MB in the beginning and 51.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:09:27,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.83ms. Allocated memory is still 174.1MB. Free memory was 115.2MB in the beginning and 148.6MB in the end (delta: -33.4MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-10-13 17:09:27,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.53ms. Allocated memory is still 174.1MB. Free memory was 148.6MB in the beginning and 146.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:09:27,438 INFO L158 Benchmark]: Boogie Preprocessor took 25.98ms. Allocated memory is still 174.1MB. Free memory was 146.9MB in the beginning and 145.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:09:27,438 INFO L158 Benchmark]: RCFGBuilder took 262.06ms. Allocated memory is still 174.1MB. Free memory was 145.7MB in the beginning and 133.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 17:09:27,438 INFO L158 Benchmark]: BuchiAutomizer took 1174.06ms. Allocated memory is still 174.1MB. Free memory was 133.1MB in the beginning and 89.6MB in the end (delta: 43.6MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-10-13 17:09:27,438 INFO L158 Benchmark]: Witness Printer took 44.31ms. Allocated memory is still 174.1MB. Free memory was 89.6MB in the beginning and 87.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:09:27,439 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.12ms. Allocated memory is still 96.5MB. Free memory was 51.0MB in the beginning and 51.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.83ms. Allocated memory is still 174.1MB. Free memory was 115.2MB in the beginning and 148.6MB in the end (delta: -33.4MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.53ms. Allocated memory is still 174.1MB. Free memory was 148.6MB in the beginning and 146.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.98ms. Allocated memory is still 174.1MB. Free memory was 146.9MB in the beginning and 145.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 262.06ms. Allocated memory is still 174.1MB. Free memory was 145.7MB in the beginning and 133.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1174.06ms. Allocated memory is still 174.1MB. Free memory was 133.1MB in the beginning and 89.6MB in the end (delta: 43.6MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 44.31ms. Allocated memory is still 174.1MB. Free memory was 89.6MB in the beginning and 87.4MB in the end (delta: 2.2MB). 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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 349 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI6 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: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-13 17:09:27,461 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)