./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/locks/test_locks_15-1.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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:26:59,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:26:59,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:26:59,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:26:59,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:26:59,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:26:59,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:26:59,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:26:59,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:26:59,177 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:26:59,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:26:59,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:26:59,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:26:59,178 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:26:59,179 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:26:59,179 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:26:59,179 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:26:59,181 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:26:59,181 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:26:59,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:26:59,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:26:59,182 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:26:59,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:26:59,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:26:59,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:26:59,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:26:59,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:26:59,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:26:59,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:26:59,183 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:26:59,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:26:59,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:26:59,184 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:26:59,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:26:59,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:26:59,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:26:59,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:26:59,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:26:59,185 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:26:59,185 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2024-11-19 14:26:59,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:26:59,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:26:59,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:26:59,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:26:59,404 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:26:59,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2024-11-19 14:27:00,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:27:00,758 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:27:00,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2024-11-19 14:27:00,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e2599d9/ed498ba855d149f1a66362d2f33941c0/FLAGe2402c687 [2024-11-19 14:27:01,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e2599d9/ed498ba855d149f1a66362d2f33941c0 [2024-11-19 14:27:01,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:27:01,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:27:01,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:27:01,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:27:01,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:27:01,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33528391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01, skipping insertion in model container [2024-11-19 14:27:01,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:27:01,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:27:01,344 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:27:01,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:27:01,385 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:27:01,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01 WrapperNode [2024-11-19 14:27:01,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:27:01,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:27:01,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:27:01,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:27:01,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,416 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 195 [2024-11-19 14:27:01,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:27:01,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:27:01,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:27:01,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:27:01,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,440 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 14:27:01,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:27:01,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:27:01,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:27:01,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:27:01,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (1/1) ... [2024-11-19 14:27:01,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:01,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:01,491 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-11-19 14:27:01,493 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-11-19 14:27:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:27:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:27:01,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:27:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:27:01,579 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:27:01,581 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:27:01,761 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-19 14:27:01,761 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:27:01,773 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:27:01,774 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:27:01,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:01 BoogieIcfgContainer [2024-11-19 14:27:01,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:27:01,775 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:27:01,775 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:27:01,778 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:27:01,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:01,779 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:27:01" (1/3) ... [2024-11-19 14:27:01,779 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47fa7320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:27:01, skipping insertion in model container [2024-11-19 14:27:01,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:01,780 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:01" (2/3) ... [2024-11-19 14:27:01,780 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47fa7320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:27:01, skipping insertion in model container [2024-11-19 14:27:01,780 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:01,780 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:01" (3/3) ... [2024-11-19 14:27:01,781 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2024-11-19 14:27:01,822 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:27:01,822 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:27:01,822 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:27:01,822 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:27:01,822 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:27:01,822 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:27:01,822 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:27:01,822 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:27:01,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:01,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-19 14:27:01,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:01,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:01,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:01,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:01,842 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:27:01,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:01,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-19 14:27:01,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:01,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:01,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:01,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:01,851 INFO L745 eck$LassoCheckResult]: Stem: 25#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 33#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 20#L225-1true [2024-11-19 14:27:01,852 INFO L747 eck$LassoCheckResult]: Loop: 20#L225-1true assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 32#L58true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 28#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 26#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L97-1true assume !(0 != main_~p3~0#1); 15#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 50#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 43#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 22#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 35#L129-1true assume !(0 != main_~p11~0#1); 3#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 5#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 38#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 55#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 47#L149-1true assume !(0 != main_~p1~0#1); 45#L155-1true assume 0 != main_~p2~0#1; 7#L161true assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 18#L160true assume !(0 != main_~p3~0#1); 10#L165-1true assume !(0 != main_~p4~0#1); 41#L170-1true assume !(0 != main_~p5~0#1); 44#L175-1true assume !(0 != main_~p6~0#1); 17#L180-1true assume !(0 != main_~p7~0#1); 37#L185-1true assume !(0 != main_~p8~0#1); 24#L190-1true assume !(0 != main_~p9~0#1); 40#L195-1true assume !(0 != main_~p10~0#1); 14#L200-1true assume !(0 != main_~p11~0#1); 42#L205-1true assume !(0 != main_~p12~0#1); 23#L210-1true assume !(0 != main_~p13~0#1); 4#L215-1true assume 0 != main_~p14~0#1; 13#L221true assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 54#L220true assume !(0 != main_~p15~0#1); 20#L225-1true [2024-11-19 14:27:01,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:27:01,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:01,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042064408] [2024-11-19 14:27:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:01,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:01,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:01,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:01,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash -638858682, now seen corresponding path program 1 times [2024-11-19 14:27:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:01,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979650437] [2024-11-19 14:27:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:02,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:02,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979650437] [2024-11-19 14:27:02,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979650437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:02,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:02,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:02,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218389988] [2024-11-19 14:27:02,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:02,059 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:02,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:02,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:02,083 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:02,114 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2024-11-19 14:27:02,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 189 transitions. [2024-11-19 14:27:02,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2024-11-19 14:27:02,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 95 states and 149 transitions. [2024-11-19 14:27:02,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-11-19 14:27:02,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-11-19 14:27:02,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 149 transitions. [2024-11-19 14:27:02,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:02,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-11-19 14:27:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 149 transitions. [2024-11-19 14:27:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-19 14:27:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2024-11-19 14:27:02,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-11-19 14:27:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:02,196 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-11-19 14:27:02,196 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:27:02,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 149 transitions. [2024-11-19 14:27:02,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2024-11-19 14:27:02,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:02,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:02,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:02,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:02,198 INFO L745 eck$LassoCheckResult]: Stem: 203#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 204#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 212#L225-1 [2024-11-19 14:27:02,198 INFO L747 eck$LassoCheckResult]: Loop: 212#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 210#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 211#L93 assume !(0 != main_~p1~0#1); 205#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 184#L97-1 assume !(0 != main_~p3~0#1); 185#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 189#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 225#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 247#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 246#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 245#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 244#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 242#L129-1 assume !(0 != main_~p11~0#1); 239#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 236#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 216#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 217#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 226#L149-1 assume !(0 != main_~p1~0#1); 221#L155-1 assume 0 != main_~p2~0#1; 174#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 175#L160 assume !(0 != main_~p3~0#1); 178#L165-1 assume !(0 != main_~p4~0#1); 179#L170-1 assume !(0 != main_~p5~0#1); 215#L175-1 assume !(0 != main_~p6~0#1); 192#L180-1 assume !(0 != main_~p7~0#1); 193#L185-1 assume !(0 != main_~p8~0#1); 241#L190-1 assume !(0 != main_~p9~0#1); 238#L195-1 assume !(0 != main_~p10~0#1); 186#L200-1 assume !(0 != main_~p11~0#1); 187#L205-1 assume !(0 != main_~p12~0#1); 207#L210-1 assume !(0 != main_~p13~0#1); 231#L215-1 assume 0 != main_~p14~0#1; 230#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 229#L220 assume !(0 != main_~p15~0#1); 212#L225-1 [2024-11-19 14:27:02,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,199 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:27:02,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005031211] [2024-11-19 14:27:02,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:27:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,208 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:02,210 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:02,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:02,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:02,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,218 INFO L85 PathProgramCache]: Analyzing trace with hash -364099068, now seen corresponding path program 1 times [2024-11-19 14:27:02,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537179490] [2024-11-19 14:27:02,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:02,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:02,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:02,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537179490] [2024-11-19 14:27:02,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537179490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:02,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:02,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:02,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847400235] [2024-11-19 14:27:02,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:02,275 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:02,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:02,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:02,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:02,276 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:02,294 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2024-11-19 14:27:02,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 290 transitions. [2024-11-19 14:27:02,296 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2024-11-19 14:27:02,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 290 transitions. [2024-11-19 14:27:02,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2024-11-19 14:27:02,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2024-11-19 14:27:02,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 290 transitions. [2024-11-19 14:27:02,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:02,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 290 transitions. [2024-11-19 14:27:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 290 transitions. [2024-11-19 14:27:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-19 14:27:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2024-11-19 14:27:02,309 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 290 transitions. [2024-11-19 14:27:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:02,310 INFO L425 stractBuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2024-11-19 14:27:02,310 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:27:02,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 290 transitions. [2024-11-19 14:27:02,312 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2024-11-19 14:27:02,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:02,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:02,312 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:02,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:02,313 INFO L745 eck$LassoCheckResult]: Stem: 492#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 493#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 499#L225-1 [2024-11-19 14:27:02,313 INFO L747 eck$LassoCheckResult]: Loop: 499#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 528#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 525#L93 assume !(0 != main_~p1~0#1); 526#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 520#L97-1 assume !(0 != main_~p3~0#1); 521#L101-1 assume !(0 != main_~p4~0#1); 595#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 594#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 593#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 592#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 591#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 590#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 589#L129-1 assume !(0 != main_~p11~0#1); 588#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 587#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 586#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 585#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 584#L149-1 assume !(0 != main_~p1~0#1); 583#L155-1 assume 0 != main_~p2~0#1; 582#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 579#L160 assume !(0 != main_~p3~0#1); 575#L165-1 assume !(0 != main_~p4~0#1); 572#L170-1 assume !(0 != main_~p5~0#1); 569#L175-1 assume !(0 != main_~p6~0#1); 565#L180-1 assume !(0 != main_~p7~0#1); 560#L185-1 assume !(0 != main_~p8~0#1); 557#L190-1 assume !(0 != main_~p9~0#1); 553#L195-1 assume !(0 != main_~p10~0#1); 549#L200-1 assume !(0 != main_~p11~0#1); 545#L205-1 assume !(0 != main_~p12~0#1); 541#L210-1 assume !(0 != main_~p13~0#1); 537#L215-1 assume 0 != main_~p14~0#1; 535#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 533#L220 assume !(0 != main_~p15~0#1); 499#L225-1 [2024-11-19 14:27:02,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:27:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000195735] [2024-11-19 14:27:02,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:27:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,318 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:27:02,318 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:02,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:02,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:02,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1022104326, now seen corresponding path program 1 times [2024-11-19 14:27:02,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386377477] [2024-11-19 14:27:02,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:02,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:02,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386377477] [2024-11-19 14:27:02,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386377477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:02,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:02,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:02,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775895478] [2024-11-19 14:27:02,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:02,375 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:02,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:02,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:02,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:02,375 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:02,403 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2024-11-19 14:27:02,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 566 transitions. [2024-11-19 14:27:02,405 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2024-11-19 14:27:02,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 566 transitions. [2024-11-19 14:27:02,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2024-11-19 14:27:02,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2024-11-19 14:27:02,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 566 transitions. [2024-11-19 14:27:02,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:02,416 INFO L218 hiAutomatonCegarLoop]: Abstraction has 366 states and 566 transitions. [2024-11-19 14:27:02,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 566 transitions. [2024-11-19 14:27:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-11-19 14:27:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 566 transitions. [2024-11-19 14:27:02,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 366 states and 566 transitions. [2024-11-19 14:27:02,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:02,441 INFO L425 stractBuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2024-11-19 14:27:02,441 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:27:02,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 566 transitions. [2024-11-19 14:27:02,442 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2024-11-19 14:27:02,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:02,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:02,443 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:02,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:02,443 INFO L745 eck$LassoCheckResult]: Stem: 1049#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1050#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1059#L225-1 [2024-11-19 14:27:02,444 INFO L747 eck$LassoCheckResult]: Loop: 1059#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1087#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1088#L93 assume !(0 != main_~p1~0#1); 1214#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 1232#L97-1 assume !(0 != main_~p3~0#1); 1229#L101-1 assume !(0 != main_~p4~0#1); 1226#L105-1 assume !(0 != main_~p5~0#1); 1224#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1223#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1221#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1219#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1217#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1215#L129-1 assume !(0 != main_~p11~0#1); 1212#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1209#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1206#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1202#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1176#L149-1 assume !(0 != main_~p1~0#1); 1174#L155-1 assume 0 != main_~p2~0#1; 1171#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 1168#L160 assume !(0 != main_~p3~0#1); 1165#L165-1 assume !(0 != main_~p4~0#1); 1162#L170-1 assume !(0 != main_~p5~0#1); 1141#L175-1 assume !(0 != main_~p6~0#1); 1137#L180-1 assume !(0 != main_~p7~0#1); 1131#L185-1 assume !(0 != main_~p8~0#1); 1127#L190-1 assume !(0 != main_~p9~0#1); 1126#L195-1 assume !(0 != main_~p10~0#1); 1250#L200-1 assume !(0 != main_~p11~0#1); 1112#L205-1 assume !(0 != main_~p12~0#1); 1111#L210-1 assume !(0 != main_~p13~0#1); 1100#L215-1 assume 0 != main_~p14~0#1; 1101#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 1095#L220 assume !(0 != main_~p15~0#1); 1059#L225-1 [2024-11-19 14:27:02,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,445 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:27:02,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337483973] [2024-11-19 14:27:02,445 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:27:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,452 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:27:02,453 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:02,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:02,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:02,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash 512631236, now seen corresponding path program 1 times [2024-11-19 14:27:02,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213402454] [2024-11-19 14:27:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:02,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213402454] [2024-11-19 14:27:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213402454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:02,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:02,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:02,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628107972] [2024-11-19 14:27:02,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:02,503 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:02,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:02,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:02,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:02,504 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:02,528 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2024-11-19 14:27:02,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1106 transitions. [2024-11-19 14:27:02,533 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2024-11-19 14:27:02,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1106 transitions. [2024-11-19 14:27:02,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2024-11-19 14:27:02,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2024-11-19 14:27:02,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1106 transitions. [2024-11-19 14:27:02,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:02,538 INFO L218 hiAutomatonCegarLoop]: Abstraction has 722 states and 1106 transitions. [2024-11-19 14:27:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1106 transitions. [2024-11-19 14:27:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2024-11-19 14:27:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1106 transitions. [2024-11-19 14:27:02,559 INFO L240 hiAutomatonCegarLoop]: Abstraction has 722 states and 1106 transitions. [2024-11-19 14:27:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:02,561 INFO L425 stractBuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2024-11-19 14:27:02,561 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:27:02,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1106 transitions. [2024-11-19 14:27:02,564 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2024-11-19 14:27:02,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:02,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:02,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:02,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:02,567 INFO L745 eck$LassoCheckResult]: Stem: 2143#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 2144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2151#L225-1 [2024-11-19 14:27:02,567 INFO L747 eck$LassoCheckResult]: Loop: 2151#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2350#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 2347#L93 assume !(0 != main_~p1~0#1); 2348#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 2337#L97-1 assume !(0 != main_~p3~0#1); 2338#L101-1 assume !(0 != main_~p4~0#1); 2325#L105-1 assume !(0 != main_~p5~0#1); 2327#L109-1 assume !(0 != main_~p6~0#1); 2313#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2314#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2301#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2302#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2289#L129-1 assume !(0 != main_~p11~0#1); 2290#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2277#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2278#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2265#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2266#L149-1 assume !(0 != main_~p1~0#1); 2398#L155-1 assume 0 != main_~p2~0#1; 2397#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 2396#L160 assume !(0 != main_~p3~0#1); 2392#L165-1 assume !(0 != main_~p4~0#1); 2390#L170-1 assume !(0 != main_~p5~0#1); 2388#L175-1 assume !(0 != main_~p6~0#1); 2385#L180-1 assume !(0 != main_~p7~0#1); 2380#L185-1 assume !(0 != main_~p8~0#1); 2377#L190-1 assume !(0 != main_~p9~0#1); 2373#L195-1 assume !(0 != main_~p10~0#1); 2369#L200-1 assume !(0 != main_~p11~0#1); 2365#L205-1 assume !(0 != main_~p12~0#1); 2361#L210-1 assume !(0 != main_~p13~0#1); 2358#L215-1 assume 0 != main_~p14~0#1; 2356#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 2355#L220 assume !(0 != main_~p15~0#1); 2151#L225-1 [2024-11-19 14:27:02,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-19 14:27:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194803756] [2024-11-19 14:27:02,568 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:27:02,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,574 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:02,574 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:02,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:02,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:02,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1859108026, now seen corresponding path program 1 times [2024-11-19 14:27:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223177802] [2024-11-19 14:27:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:02,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:02,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223177802] [2024-11-19 14:27:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223177802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:02,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:02,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:02,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389960514] [2024-11-19 14:27:02,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:02,621 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:02,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:02,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:02,621 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:02,636 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2024-11-19 14:27:02,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2162 transitions. [2024-11-19 14:27:02,645 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2024-11-19 14:27:02,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2162 transitions. [2024-11-19 14:27:02,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2024-11-19 14:27:02,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2024-11-19 14:27:02,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2162 transitions. [2024-11-19 14:27:02,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:02,652 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2024-11-19 14:27:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2162 transitions. [2024-11-19 14:27:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2024-11-19 14:27:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2162 transitions. [2024-11-19 14:27:02,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2024-11-19 14:27:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:02,673 INFO L425 stractBuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2024-11-19 14:27:02,673 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:27:02,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2162 transitions. [2024-11-19 14:27:02,678 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2024-11-19 14:27:02,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:02,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:02,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:02,679 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:02,679 INFO L745 eck$LassoCheckResult]: Stem: 4298#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 4299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4304#L225-1 [2024-11-19 14:27:02,679 INFO L747 eck$LassoCheckResult]: Loop: 4304#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4525#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 4522#L93 assume !(0 != main_~p1~0#1); 4426#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4423#L97-1 assume !(0 != main_~p3~0#1); 4419#L101-1 assume !(0 != main_~p4~0#1); 4416#L105-1 assume !(0 != main_~p5~0#1); 4380#L109-1 assume !(0 != main_~p6~0#1); 4381#L113-1 assume !(0 != main_~p7~0#1); 4664#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4660#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4656#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4652#L129-1 assume !(0 != main_~p11~0#1); 4648#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4644#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4640#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4637#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4632#L149-1 assume !(0 != main_~p1~0#1); 4629#L155-1 assume 0 != main_~p2~0#1; 4625#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 4621#L160 assume !(0 != main_~p3~0#1); 4612#L165-1 assume !(0 != main_~p4~0#1); 4608#L170-1 assume !(0 != main_~p5~0#1); 4604#L175-1 assume !(0 != main_~p6~0#1); 4605#L180-1 assume !(0 != main_~p7~0#1); 4616#L185-1 assume !(0 != main_~p8~0#1); 4595#L190-1 assume !(0 != main_~p9~0#1); 4591#L195-1 assume !(0 != main_~p10~0#1); 4564#L200-1 assume !(0 != main_~p11~0#1); 4538#L205-1 assume !(0 != main_~p12~0#1); 4534#L210-1 assume !(0 != main_~p13~0#1); 4531#L215-1 assume 0 != main_~p14~0#1; 4529#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 4527#L220 assume !(0 != main_~p15~0#1); 4304#L225-1 [2024-11-19 14:27:02,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,680 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-19 14:27:02,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284926877] [2024-11-19 14:27:02,680 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:27:02,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,683 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:27:02,684 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:02,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:02,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:02,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1797068412, now seen corresponding path program 1 times [2024-11-19 14:27:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703601806] [2024-11-19 14:27:02,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:02,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703601806] [2024-11-19 14:27:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703601806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:02,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:02,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387076121] [2024-11-19 14:27:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:02,723 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:02,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:02,724 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:02,746 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2024-11-19 14:27:02,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4226 transitions. [2024-11-19 14:27:02,764 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2024-11-19 14:27:02,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4226 transitions. [2024-11-19 14:27:02,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2024-11-19 14:27:02,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2024-11-19 14:27:02,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4226 transitions. [2024-11-19 14:27:02,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:02,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2024-11-19 14:27:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4226 transitions. [2024-11-19 14:27:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2024-11-19 14:27:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4226 transitions. [2024-11-19 14:27:02,882 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2024-11-19 14:27:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:02,887 INFO L425 stractBuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2024-11-19 14:27:02,887 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:27:02,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4226 transitions. [2024-11-19 14:27:02,899 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2024-11-19 14:27:02,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:02,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:02,900 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:02,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:02,900 INFO L745 eck$LassoCheckResult]: Stem: 8550#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 8551#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8555#L225-1 [2024-11-19 14:27:02,900 INFO L747 eck$LassoCheckResult]: Loop: 8555#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8710#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 8711#L93 assume !(0 != main_~p1~0#1); 8826#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 8825#L97-1 assume !(0 != main_~p3~0#1); 8823#L101-1 assume !(0 != main_~p4~0#1); 8820#L105-1 assume !(0 != main_~p5~0#1); 8816#L109-1 assume !(0 != main_~p6~0#1); 8812#L113-1 assume !(0 != main_~p7~0#1); 8808#L117-1 assume !(0 != main_~p8~0#1); 8806#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8804#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8802#L129-1 assume !(0 != main_~p11~0#1); 8800#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8798#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8796#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8794#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8791#L149-1 assume !(0 != main_~p1~0#1); 8792#L155-1 assume 0 != main_~p2~0#1; 8780#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 8781#L160 assume !(0 != main_~p3~0#1); 8770#L165-1 assume !(0 != main_~p4~0#1); 8771#L170-1 assume !(0 != main_~p5~0#1); 8759#L175-1 assume !(0 != main_~p6~0#1); 8761#L180-1 assume !(0 != main_~p7~0#1); 8751#L185-1 assume !(0 != main_~p8~0#1); 8752#L190-1 assume !(0 != main_~p9~0#1); 8744#L195-1 assume !(0 != main_~p10~0#1); 8743#L200-1 assume !(0 != main_~p11~0#1); 8734#L205-1 assume !(0 != main_~p12~0#1); 8733#L210-1 assume !(0 != main_~p13~0#1); 8723#L215-1 assume 0 != main_~p14~0#1; 8724#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 8718#L220 assume !(0 != main_~p15~0#1); 8555#L225-1 [2024-11-19 14:27:02,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,901 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-19 14:27:02,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245884523] [2024-11-19 14:27:02,901 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:27:02,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:02,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:02,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:02,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:02,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1656519802, now seen corresponding path program 1 times [2024-11-19 14:27:02,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:02,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155327871] [2024-11-19 14:27:02,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:02,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:02,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:02,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155327871] [2024-11-19 14:27:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155327871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:02,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:02,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:02,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684647909] [2024-11-19 14:27:02,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:02,930 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:02,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:02,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:02,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:02,931 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:02,960 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2024-11-19 14:27:02,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8258 transitions. [2024-11-19 14:27:02,991 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2024-11-19 14:27:03,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8258 transitions. [2024-11-19 14:27:03,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2024-11-19 14:27:03,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2024-11-19 14:27:03,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8258 transitions. [2024-11-19 14:27:03,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:03,017 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2024-11-19 14:27:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8258 transitions. [2024-11-19 14:27:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2024-11-19 14:27:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8258 transitions. [2024-11-19 14:27:03,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2024-11-19 14:27:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:03,085 INFO L425 stractBuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2024-11-19 14:27:03,085 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:27:03,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8258 transitions. [2024-11-19 14:27:03,100 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2024-11-19 14:27:03,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:03,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:03,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:03,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:03,101 INFO L745 eck$LassoCheckResult]: Stem: 16938#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 16939#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16944#L225-1 [2024-11-19 14:27:03,101 INFO L747 eck$LassoCheckResult]: Loop: 16944#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17264#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 17258#L93 assume !(0 != main_~p1~0#1); 17255#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 17248#L97-1 assume !(0 != main_~p3~0#1); 17249#L101-1 assume !(0 != main_~p4~0#1); 17250#L105-1 assume !(0 != main_~p5~0#1); 17359#L109-1 assume !(0 != main_~p6~0#1); 17334#L113-1 assume !(0 != main_~p7~0#1); 17332#L117-1 assume !(0 != main_~p8~0#1); 17330#L121-1 assume !(0 != main_~p9~0#1); 17329#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17328#L129-1 assume !(0 != main_~p11~0#1); 17327#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17326#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17325#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17324#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17322#L149-1 assume !(0 != main_~p1~0#1); 17320#L155-1 assume 0 != main_~p2~0#1; 17319#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 17154#L160 assume !(0 != main_~p3~0#1); 17153#L165-1 assume !(0 != main_~p4~0#1); 17137#L170-1 assume !(0 != main_~p5~0#1); 17138#L175-1 assume !(0 != main_~p6~0#1); 17115#L180-1 assume !(0 != main_~p7~0#1); 17116#L185-1 assume !(0 != main_~p8~0#1); 17305#L190-1 assume !(0 != main_~p9~0#1); 17300#L195-1 assume !(0 != main_~p10~0#1); 17294#L200-1 assume !(0 != main_~p11~0#1); 17288#L205-1 assume !(0 != main_~p12~0#1); 17282#L210-1 assume !(0 != main_~p13~0#1); 17278#L215-1 assume 0 != main_~p14~0#1; 17275#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 17270#L220 assume !(0 != main_~p15~0#1); 16944#L225-1 [2024-11-19 14:27:03,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:03,101 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-19 14:27:03,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:03,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373409897] [2024-11-19 14:27:03,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:27:03,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:03,106 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:03,106 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:03,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:03,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:03,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1790533308, now seen corresponding path program 1 times [2024-11-19 14:27:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481403076] [2024-11-19 14:27:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:03,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:03,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:03,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481403076] [2024-11-19 14:27:03,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481403076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:03,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:03,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:03,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536233821] [2024-11-19 14:27:03,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:03,153 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:03,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:03,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:03,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:03,154 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:03,193 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2024-11-19 14:27:03,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16130 transitions. [2024-11-19 14:27:03,235 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2024-11-19 14:27:03,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16130 transitions. [2024-11-19 14:27:03,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2024-11-19 14:27:03,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2024-11-19 14:27:03,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16130 transitions. [2024-11-19 14:27:03,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:03,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2024-11-19 14:27:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16130 transitions. [2024-11-19 14:27:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2024-11-19 14:27:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16130 transitions. [2024-11-19 14:27:03,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2024-11-19 14:27:03,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:03,488 INFO L425 stractBuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2024-11-19 14:27:03,488 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:27:03,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16130 transitions. [2024-11-19 14:27:03,523 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2024-11-19 14:27:03,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:03,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:03,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:03,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:03,524 INFO L745 eck$LassoCheckResult]: Stem: 33526#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 33527#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33536#L225-1 [2024-11-19 14:27:03,525 INFO L747 eck$LassoCheckResult]: Loop: 33536#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33840#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 33838#L93 assume !(0 != main_~p1~0#1); 33837#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 33836#L97-1 assume !(0 != main_~p3~0#1); 33834#L101-1 assume !(0 != main_~p4~0#1); 33832#L105-1 assume !(0 != main_~p5~0#1); 33830#L109-1 assume !(0 != main_~p6~0#1); 33829#L113-1 assume !(0 != main_~p7~0#1); 33827#L117-1 assume !(0 != main_~p8~0#1); 33823#L121-1 assume !(0 != main_~p9~0#1); 33820#L125-1 assume !(0 != main_~p10~0#1); 33814#L129-1 assume !(0 != main_~p11~0#1); 33815#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 33806#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 33807#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 33798#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 33799#L149-1 assume !(0 != main_~p1~0#1); 33788#L155-1 assume 0 != main_~p2~0#1; 33789#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 33780#L160 assume !(0 != main_~p3~0#1); 33779#L165-1 assume !(0 != main_~p4~0#1); 33719#L170-1 assume !(0 != main_~p5~0#1); 33720#L175-1 assume !(0 != main_~p6~0#1); 33710#L180-1 assume !(0 != main_~p7~0#1); 33711#L185-1 assume !(0 != main_~p8~0#1); 33698#L190-1 assume !(0 != main_~p9~0#1); 33700#L195-1 assume !(0 != main_~p10~0#1); 33850#L200-1 assume !(0 != main_~p11~0#1); 33848#L205-1 assume !(0 != main_~p12~0#1); 33846#L210-1 assume !(0 != main_~p13~0#1); 33844#L215-1 assume 0 != main_~p14~0#1; 33843#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 33842#L220 assume !(0 != main_~p15~0#1); 33536#L225-1 [2024-11-19 14:27:03,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-19 14:27:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:03,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941176541] [2024-11-19 14:27:03,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:27:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:03,532 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:27:03,532 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:03,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:03,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:03,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash 698995654, now seen corresponding path program 1 times [2024-11-19 14:27:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:03,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521550287] [2024-11-19 14:27:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:03,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:03,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:03,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521550287] [2024-11-19 14:27:03,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521550287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:03,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:03,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596051784] [2024-11-19 14:27:03,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:03,564 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:03,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:03,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:03,565 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:03,624 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2024-11-19 14:27:03,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 31490 transitions. [2024-11-19 14:27:03,765 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2024-11-19 14:27:03,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 31490 transitions. [2024-11-19 14:27:03,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2024-11-19 14:27:03,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2024-11-19 14:27:03,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 31490 transitions. [2024-11-19 14:27:03,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:03,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2024-11-19 14:27:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 31490 transitions. [2024-11-19 14:27:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2024-11-19 14:27:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 31490 transitions. [2024-11-19 14:27:04,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2024-11-19 14:27:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:04,178 INFO L425 stractBuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2024-11-19 14:27:04,178 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:27:04,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 31490 transitions. [2024-11-19 14:27:04,262 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2024-11-19 14:27:04,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:04,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:04,263 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:04,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:04,263 INFO L745 eck$LassoCheckResult]: Stem: 66304#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 66305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66309#L225-1 [2024-11-19 14:27:04,263 INFO L747 eck$LassoCheckResult]: Loop: 66309#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66490#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 66486#L93 assume !(0 != main_~p1~0#1); 66484#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 66482#L97-1 assume !(0 != main_~p3~0#1); 66478#L101-1 assume !(0 != main_~p4~0#1); 66474#L105-1 assume !(0 != main_~p5~0#1); 66472#L109-1 assume !(0 != main_~p6~0#1); 66468#L113-1 assume !(0 != main_~p7~0#1); 66464#L117-1 assume !(0 != main_~p8~0#1); 66460#L121-1 assume !(0 != main_~p9~0#1); 66456#L125-1 assume !(0 != main_~p10~0#1); 66454#L129-1 assume !(0 != main_~p11~0#1); 66450#L133-1 assume !(0 != main_~p12~0#1); 66448#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66446#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66444#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66440#L149-1 assume !(0 != main_~p1~0#1); 66438#L155-1 assume 0 != main_~p2~0#1; 66436#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 66433#L160 assume !(0 != main_~p3~0#1); 66428#L165-1 assume !(0 != main_~p4~0#1); 66424#L170-1 assume !(0 != main_~p5~0#1); 66421#L175-1 assume !(0 != main_~p6~0#1); 66422#L180-1 assume !(0 != main_~p7~0#1); 66521#L185-1 assume !(0 != main_~p8~0#1); 66517#L190-1 assume !(0 != main_~p9~0#1); 66513#L195-1 assume !(0 != main_~p10~0#1); 66510#L200-1 assume !(0 != main_~p11~0#1); 66505#L205-1 assume !(0 != main_~p12~0#1); 66502#L210-1 assume !(0 != main_~p13~0#1); 66499#L215-1 assume 0 != main_~p14~0#1; 66497#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 66494#L220 assume !(0 != main_~p15~0#1); 66309#L225-1 [2024-11-19 14:27:04,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-11-19 14:27:04,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803902137] [2024-11-19 14:27:04,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:27:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,272 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:27:04,272 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:04,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:04,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1121697480, now seen corresponding path program 1 times [2024-11-19 14:27:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460650468] [2024-11-19 14:27:04,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:04,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:04,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:04,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460650468] [2024-11-19 14:27:04,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460650468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:04,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:04,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:04,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493823014] [2024-11-19 14:27:04,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:04,314 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:04,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:04,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:04,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:04,315 INFO L87 Difference]: Start difference. First operand 21762 states and 31490 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:04,489 INFO L93 Difference]: Finished difference Result 43010 states and 61442 transitions. [2024-11-19 14:27:04,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 61442 transitions. [2024-11-19 14:27:04,778 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2024-11-19 14:27:04,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 61442 transitions. [2024-11-19 14:27:04,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2024-11-19 14:27:04,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2024-11-19 14:27:04,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 61442 transitions. [2024-11-19 14:27:04,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:04,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2024-11-19 14:27:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 61442 transitions. [2024-11-19 14:27:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2024-11-19 14:27:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4285514996512438) internal successors, (61442), 43009 states have internal predecessors, (61442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 61442 transitions. [2024-11-19 14:27:05,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2024-11-19 14:27:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:05,528 INFO L425 stractBuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2024-11-19 14:27:05,529 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:27:05,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 61442 transitions. [2024-11-19 14:27:05,646 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2024-11-19 14:27:05,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:05,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:05,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:05,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:05,647 INFO L745 eck$LassoCheckResult]: Stem: 131082#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 131083#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131091#L225-1 [2024-11-19 14:27:05,647 INFO L747 eck$LassoCheckResult]: Loop: 131091#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 132067#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 132025#L93 assume !(0 != main_~p1~0#1); 132027#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 132019#L97-1 assume !(0 != main_~p3~0#1); 132020#L101-1 assume !(0 != main_~p4~0#1); 132010#L105-1 assume !(0 != main_~p5~0#1); 132012#L109-1 assume !(0 != main_~p6~0#1); 132004#L113-1 assume !(0 != main_~p7~0#1); 132006#L117-1 assume !(0 != main_~p8~0#1); 132192#L121-1 assume !(0 != main_~p9~0#1); 132188#L125-1 assume !(0 != main_~p10~0#1); 132147#L129-1 assume !(0 != main_~p11~0#1); 132145#L133-1 assume !(0 != main_~p12~0#1); 132141#L137-1 assume !(0 != main_~p13~0#1); 132138#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 132137#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 132122#L149-1 assume !(0 != main_~p1~0#1); 132121#L155-1 assume 0 != main_~p2~0#1; 132120#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 132119#L160 assume !(0 != main_~p3~0#1); 132116#L165-1 assume !(0 != main_~p4~0#1); 132114#L170-1 assume !(0 != main_~p5~0#1); 132113#L175-1 assume !(0 != main_~p6~0#1); 132111#L180-1 assume !(0 != main_~p7~0#1); 132109#L185-1 assume !(0 != main_~p8~0#1); 132107#L190-1 assume !(0 != main_~p9~0#1); 132105#L195-1 assume !(0 != main_~p10~0#1); 131936#L200-1 assume !(0 != main_~p11~0#1); 131935#L205-1 assume !(0 != main_~p12~0#1); 132094#L210-1 assume !(0 != main_~p13~0#1); 132089#L215-1 assume 0 != main_~p14~0#1; 132084#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 132077#L220 assume !(0 != main_~p15~0#1); 131091#L225-1 [2024-11-19 14:27:05,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-11-19 14:27:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:05,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494753013] [2024-11-19 14:27:05,648 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:27:05,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:05,651 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:05,651 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:05,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:05,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:05,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 304049030, now seen corresponding path program 1 times [2024-11-19 14:27:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:05,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853787716] [2024-11-19 14:27:05,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:05,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:05,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:05,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853787716] [2024-11-19 14:27:05,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853787716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:05,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:05,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:27:05,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751717606] [2024-11-19 14:27:05,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:05,677 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:05,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:05,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:05,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:05,677 INFO L87 Difference]: Start difference. First operand 43010 states and 61442 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:05,933 INFO L93 Difference]: Finished difference Result 84994 states and 119810 transitions. [2024-11-19 14:27:05,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 119810 transitions. [2024-11-19 14:27:06,426 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2024-11-19 14:27:06,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 119810 transitions. [2024-11-19 14:27:06,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2024-11-19 14:27:06,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2024-11-19 14:27:06,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 119810 transitions. [2024-11-19 14:27:06,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:06,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2024-11-19 14:27:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 119810 transitions. [2024-11-19 14:27:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2024-11-19 14:27:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.409628914982234) internal successors, (119810), 84993 states have internal predecessors, (119810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 119810 transitions. [2024-11-19 14:27:07,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2024-11-19 14:27:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:07,614 INFO L425 stractBuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2024-11-19 14:27:07,614 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 14:27:07,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 119810 transitions. [2024-11-19 14:27:07,961 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2024-11-19 14:27:07,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:07,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:07,962 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:07,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:07,962 INFO L745 eck$LassoCheckResult]: Stem: 259095#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 259096#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259107#L225-1 [2024-11-19 14:27:07,962 INFO L747 eck$LassoCheckResult]: Loop: 259107#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 260516#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 260513#L93 assume !(0 != main_~p1~0#1); 260510#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 260508#L97-1 assume !(0 != main_~p3~0#1); 260505#L101-1 assume !(0 != main_~p4~0#1); 260501#L105-1 assume !(0 != main_~p5~0#1); 260497#L109-1 assume !(0 != main_~p6~0#1); 260493#L113-1 assume !(0 != main_~p7~0#1); 260489#L117-1 assume !(0 != main_~p8~0#1); 260485#L121-1 assume !(0 != main_~p9~0#1); 260481#L125-1 assume !(0 != main_~p10~0#1); 260478#L129-1 assume !(0 != main_~p11~0#1); 260475#L133-1 assume !(0 != main_~p12~0#1); 260476#L137-1 assume !(0 != main_~p13~0#1); 260580#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 260576#L145-1 assume !(0 != main_~p15~0#1); 260572#L149-1 assume !(0 != main_~p1~0#1); 260570#L155-1 assume 0 != main_~p2~0#1; 260568#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 260565#L160 assume !(0 != main_~p3~0#1); 260560#L165-1 assume !(0 != main_~p4~0#1); 260556#L170-1 assume !(0 != main_~p5~0#1); 260552#L175-1 assume !(0 != main_~p6~0#1); 260548#L180-1 assume !(0 != main_~p7~0#1); 260544#L185-1 assume !(0 != main_~p8~0#1); 260540#L190-1 assume !(0 != main_~p9~0#1); 260536#L195-1 assume !(0 != main_~p10~0#1); 260533#L200-1 assume !(0 != main_~p11~0#1); 260530#L205-1 assume !(0 != main_~p12~0#1); 260527#L210-1 assume !(0 != main_~p13~0#1); 260525#L215-1 assume 0 != main_~p14~0#1; 260523#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 260520#L220 assume !(0 != main_~p15~0#1); 259107#L225-1 [2024-11-19 14:27:07,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2024-11-19 14:27:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:07,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328679112] [2024-11-19 14:27:07,963 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:27:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:07,966 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:27:07,966 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:07,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:07,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:07,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1690095676, now seen corresponding path program 1 times [2024-11-19 14:27:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:07,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944372375] [2024-11-19 14:27:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:07,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:07,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:07,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:07,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:07,977 INFO L85 PathProgramCache]: Analyzing trace with hash 365150982, now seen corresponding path program 1 times [2024-11-19 14:27:07,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:07,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75404045] [2024-11-19 14:27:07,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:07,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:07,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:07,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:08,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:08,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:27:08 BoogieIcfgContainer [2024-11-19 14:27:08,615 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:27:08,616 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:27:08,616 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:27:08,616 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:27:08,616 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:01" (3/4) ... [2024-11-19 14:27:08,618 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:27:08,656 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:27:08,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:27:08,657 INFO L158 Benchmark]: Toolchain (without parser) took 7495.92ms. Allocated memory was 188.7MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 118.0MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 567.8MB. Max. memory is 16.1GB. [2024-11-19 14:27:08,657 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:27:08,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.21ms. Allocated memory is still 188.7MB. Free memory was 118.0MB in the beginning and 104.3MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 14:27:08,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.98ms. Allocated memory is still 188.7MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:08,658 INFO L158 Benchmark]: Boogie Preprocessor took 35.76ms. Allocated memory is still 188.7MB. Free memory was 102.2MB in the beginning and 100.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:08,658 INFO L158 Benchmark]: RCFGBuilder took 318.18ms. Allocated memory is still 188.7MB. Free memory was 100.1MB in the beginning and 81.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 14:27:08,658 INFO L158 Benchmark]: BuchiAutomizer took 6839.97ms. Allocated memory was 188.7MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 81.7MB in the beginning and 7.6GB in the end (delta: -7.6GB). Peak memory consumption was 525.8MB. Max. memory is 16.1GB. [2024-11-19 14:27:08,658 INFO L158 Benchmark]: Witness Printer took 40.57ms. Allocated memory is still 8.3GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 14:27:08,660 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.15ms. Allocated memory is still 125.8MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.21ms. Allocated memory is still 188.7MB. Free memory was 118.0MB in the beginning and 104.3MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.98ms. Allocated memory is still 188.7MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.76ms. Allocated memory is still 188.7MB. Free memory was 102.2MB in the beginning and 100.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 318.18ms. Allocated memory is still 188.7MB. Free memory was 100.1MB in the beginning and 81.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 6839.97ms. Allocated memory was 188.7MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 81.7MB in the beginning and 7.6GB in the end (delta: -7.6GB). Peak memory consumption was 525.8MB. Max. memory is 16.1GB. * Witness Printer took 40.57ms. Allocated memory is still 8.3GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 84994 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 4.6s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.4s 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, 646 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 2070 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 800 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1270 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 56]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND TRUE p2 != 0 [L98] lk2 = 1 [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND TRUE p14 != 0 [L146] lk14 = 1 [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND TRUE p2 != 0 [L161] COND FALSE !(lk2 != 1) [L162] lk2 = 0 [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND TRUE p14 != 0 [L221] COND FALSE !(lk14 != 1) [L222] lk14 = 0 [L225] COND FALSE !(p15 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND TRUE p2 != 0 [L98] lk2 = 1 [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND TRUE p14 != 0 [L146] lk14 = 1 [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND TRUE p2 != 0 [L161] COND FALSE !(lk2 != 1) [L162] lk2 = 0 [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND TRUE p14 != 0 [L221] COND FALSE !(lk14 != 1) [L222] lk14 = 0 [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 14:27:08,681 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)