./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f 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/loop-simple/nested_4.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 fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:05:54,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:05:54,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 23:05:54,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:05:54,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:05:54,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:05:54,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:05:54,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:05:54,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:05:54,481 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:05:54,482 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:05:54,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:05:54,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:05:54,483 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:05:54,483 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:05:54,485 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:05:54,486 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:05:54,487 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:05:54,487 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:05:54,487 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:05:54,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:05:54,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:05:54,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:05:54,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:05:54,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:05:54,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:05:54,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:05:54,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:05:54,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:05:54,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:05:54,492 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:05:54,492 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:05:54,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:05:54,492 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:05:54,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:05:54,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:05:54,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:05:54,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:05:54,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:05:54,494 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:05:54,494 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 -> fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf [2024-11-10 23:05:54,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:05:54,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:05:54,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:05:54,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:05:54,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:05:54,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_4.c [2024-11-10 23:05:55,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:05:56,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:05:56,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_4.c [2024-11-10 23:05:56,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3cfbbf2f/2e0d981d99384dce95c75ff524fc5c0a/FLAG26ff1782e [2024-11-10 23:05:56,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3cfbbf2f/2e0d981d99384dce95c75ff524fc5c0a [2024-11-10 23:05:56,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:05:56,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:05:56,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:05:56,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:05:56,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:05:56,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed0a495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56, skipping insertion in model container [2024-11-10 23:05:56,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:05:56,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:05:56,206 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:05:56,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:05:56,228 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:05:56,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56 WrapperNode [2024-11-10 23:05:56,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:05:56,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:05:56,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:05:56,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:05:56,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,264 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2024-11-10 23:05:56,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:05:56,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:05:56,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:05:56,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:05:56,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,287 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-10 23:05:56,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:05:56,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:05:56,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:05:56,292 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:05:56,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:56,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:56,318 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-10 23:05:56,320 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-10 23:05:56,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:05:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:05:56,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:05:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:05:56,403 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:05:56,405 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:05:56,490 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-10 23:05:56,490 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:05:56,500 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:05:56,500 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:05:56,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:56 BoogieIcfgContainer [2024-11-10 23:05:56,501 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:05:56,501 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:05:56,501 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:05:56,505 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:05:56,507 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:56,507 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:05:56" (1/3) ... [2024-11-10 23:05:56,508 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d3e45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:05:56, skipping insertion in model container [2024-11-10 23:05:56,508 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:56,508 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (2/3) ... [2024-11-10 23:05:56,509 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d3e45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:05:56, skipping insertion in model container [2024-11-10 23:05:56,509 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:56,509 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:56" (3/3) ... [2024-11-10 23:05:56,510 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_4.c [2024-11-10 23:05:56,566 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:05:56,566 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:05:56,566 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:05:56,567 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:05:56,567 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:05:56,567 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:05:56,567 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:05:56,567 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:05:56,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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-10 23:05:56,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-10 23:05:56,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:56,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:56,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:56,592 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 23:05:56,592 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:05:56,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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-10 23:05:56,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-10 23:05:56,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:56,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:56,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:56,595 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 23:05:56,600 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue 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(11, 2);call #Ultimate.allocInit(12, 3); 14#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 12#L22true [2024-11-10 23:05:56,601 INFO L747 eck$LassoCheckResult]: Loop: 12#L22true assume true; 9#L22-2true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 18#L23true assume !true; 5#L22-1true main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 12#L22true [2024-11-10 23:05:56,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:56,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2048, now seen corresponding path program 1 times [2024-11-10 23:05:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:56,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782828260] [2024-11-10 23:05:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:56,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:56,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:56,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1876684, now seen corresponding path program 1 times [2024-11-10 23:05:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660154338] [2024-11-10 23:05:56,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:56,760 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-10 23:05:56,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:56,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660154338] [2024-11-10 23:05:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660154338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:05:56,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:05:56,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 23:05:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537042349] [2024-11-10 23:05:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:05:56,766 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:56,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:56,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 23:05:56,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 23:05:56,792 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-10 23:05:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:56,797 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2024-11-10 23:05:56,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2024-11-10 23:05:56,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-10 23:05:56,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 16 transitions. [2024-11-10 23:05:56,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 23:05:56,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-10 23:05:56,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2024-11-10 23:05:56,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:56,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-10 23:05:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2024-11-10 23:05:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-10 23:05:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-11-10 23:05:56,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-10 23:05:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 23:05:56,823 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-10 23:05:56,823 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:05:56,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-11-10 23:05:56,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-10 23:05:56,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:56,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:56,824 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:56,824 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 23:05:56,824 INFO L745 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 48#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 46#L22 [2024-11-10 23:05:56,824 INFO L747 eck$LassoCheckResult]: Loop: 46#L22 assume true; 56#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 53#L23 assume true; 57#L23-2 assume !(main_~b~0#1 < 6); 45#L22-1 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 46#L22 [2024-11-10 23:05:56,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2048, now seen corresponding path program 2 times [2024-11-10 23:05:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:56,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374501120] [2024-11-10 23:05:56,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:56,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:56,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:56,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:56,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash 58176745, now seen corresponding path program 1 times [2024-11-10 23:05:56,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:56,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952083870] [2024-11-10 23:05:56,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:56,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:56,874 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-10 23:05:56,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:56,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952083870] [2024-11-10 23:05:56,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952083870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:05:56,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:05:56,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 23:05:56,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698447533] [2024-11-10 23:05:56,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:05:56,876 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:56,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 23:05:56,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 23:05:56,877 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-10 23:05:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:56,889 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-10 23:05:56,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2024-11-10 23:05:56,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-11-10 23:05:56,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 26 transitions. [2024-11-10 23:05:56,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-10 23:05:56,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-10 23:05:56,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2024-11-10 23:05:56,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:56,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-10 23:05:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2024-11-10 23:05:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2024-11-10 23:05:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-10 23:05:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-11-10 23:05:56,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-10 23:05:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 23:05:56,896 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-10 23:05:56,896 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 23:05:56,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2024-11-10 23:05:56,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-10 23:05:56,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:56,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:56,897 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:56,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:56,897 INFO L745 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 86#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 88#L22 [2024-11-10 23:05:56,897 INFO L747 eck$LassoCheckResult]: Loop: 88#L22 assume true; 93#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 94#L23 assume true; 98#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 97#L24 assume true; 89#L24-2 assume !(main_~c~0#1 < 6); 90#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 95#L23 assume true; 99#L23-2 assume !(main_~b~0#1 < 6); 87#L22-1 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 88#L22 [2024-11-10 23:05:56,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2048, now seen corresponding path program 3 times [2024-11-10 23:05:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:56,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664286816] [2024-11-10 23:05:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:56,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:56,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:56,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash -978161026, now seen corresponding path program 1 times [2024-11-10 23:05:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:56,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293745493] [2024-11-10 23:05:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:56,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:56,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293745493] [2024-11-10 23:05:56,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293745493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:05:56,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:05:56,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 23:05:56,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405323019] [2024-11-10 23:05:56,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:05:56,942 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:56,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:56,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 23:05:56,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 23:05:56,943 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10 23:05:56,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:56,960 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-10 23:05:56,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-11-10 23:05:56,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-10 23:05:56,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2024-11-10 23:05:56,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-10 23:05:56,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-10 23:05:56,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2024-11-10 23:05:56,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:56,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-10 23:05:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2024-11-10 23:05:56,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2024-11-10 23:05:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-10 23:05:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-10 23:05:56,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-10 23:05:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 23:05:56,969 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-10 23:05:56,969 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 23:05:56,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2024-11-10 23:05:56,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-10 23:05:56,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:56,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:56,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:56,971 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:56,971 INFO L745 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 127#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 129#L22 [2024-11-10 23:05:56,972 INFO L747 eck$LassoCheckResult]: Loop: 129#L22 assume true; 133#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 134#L23 assume true; 139#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 140#L24 assume true; 130#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 131#L25 assume true; 132#L25-2 assume !(main_~d~0#1 < 6); 135#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 136#L24 assume true; 142#L24-2 assume !(main_~c~0#1 < 6); 137#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 138#L23 assume true; 141#L23-2 assume !(main_~b~0#1 < 6); 128#L22-1 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 129#L22 [2024-11-10 23:05:56,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:56,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2048, now seen corresponding path program 4 times [2024-11-10 23:05:56,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004268640] [2024-11-10 23:05:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:56,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:56,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:56,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash -679472852, now seen corresponding path program 1 times [2024-11-10 23:05:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:56,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908928926] [2024-11-10 23:05:56,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:56,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908928926] [2024-11-10 23:05:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908928926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:05:57,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:05:57,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 23:05:57,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387743293] [2024-11-10 23:05:57,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:05:57,011 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:57,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:57,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 23:05:57,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 23:05:57,011 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 23:05:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:57,020 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-10 23:05:57,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2024-11-10 23:05:57,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-10 23:05:57,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 22 transitions. [2024-11-10 23:05:57,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-10 23:05:57,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-10 23:05:57,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-11-10 23:05:57,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:57,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-10 23:05:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-11-10 23:05:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-10 23:05:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-10 23:05:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-10 23:05:57,023 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-10 23:05:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 23:05:57,025 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-10 23:05:57,025 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 23:05:57,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2024-11-10 23:05:57,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-10 23:05:57,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:57,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:57,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:57,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:57,026 INFO L745 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 171#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 169#L22 [2024-11-10 23:05:57,027 INFO L747 eck$LassoCheckResult]: Loop: 169#L22 assume true; 179#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 180#L23 assume true; 182#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 183#L24 assume true; 172#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 173#L25 assume true; 174#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 181#L25 assume true; 185#L25-2 assume !(main_~d~0#1 < 6); 175#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 176#L24 assume true; 186#L24-2 assume !(main_~c~0#1 < 6); 177#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 178#L23 assume true; 184#L23-2 assume !(main_~b~0#1 < 6); 168#L22-1 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 169#L22 [2024-11-10 23:05:57,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2048, now seen corresponding path program 5 times [2024-11-10 23:05:57,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082103538] [2024-11-10 23:05:57,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:57,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1954422291, now seen corresponding path program 1 times [2024-11-10 23:05:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966557238] [2024-11-10 23:05:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:57,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966557238] [2024-11-10 23:05:57,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966557238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:05:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222759159] [2024-11-10 23:05:57,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:05:57,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:57,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:05:57,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 23:05:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:57,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 23:05:57,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:05:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222759159] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:05:57,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:05:57,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-10 23:05:57,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726631199] [2024-11-10 23:05:57,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:05:57,245 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:57,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:57,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 23:05:57,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 23:05:57,246 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10 23:05:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:57,273 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-10 23:05:57,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2024-11-10 23:05:57,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-10 23:05:57,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 28 transitions. [2024-11-10 23:05:57,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-10 23:05:57,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-10 23:05:57,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2024-11-10 23:05:57,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:57,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-10 23:05:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2024-11-10 23:05:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-10 23:05:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-10 23:05:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-10 23:05:57,277 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-10 23:05:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 23:05:57,279 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-10 23:05:57,279 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 23:05:57,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2024-11-10 23:05:57,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-10 23:05:57,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:57,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:57,280 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:57,281 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:57,281 INFO L745 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 318#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 320#L22 [2024-11-10 23:05:57,282 INFO L747 eck$LassoCheckResult]: Loop: 320#L22 assume true; 324#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 325#L23 assume true; 331#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 332#L24 assume true; 321#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 322#L25 assume true; 323#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 330#L25 assume true; 341#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 340#L25 assume true; 339#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 338#L25 assume true; 337#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 335#L25 assume true; 334#L25-2 assume !(main_~d~0#1 < 6); 326#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 327#L24 assume true; 336#L24-2 assume !(main_~c~0#1 < 6); 328#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 329#L23 assume true; 333#L23-2 assume !(main_~b~0#1 < 6); 319#L22-1 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 320#L22 [2024-11-10 23:05:57,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2048, now seen corresponding path program 6 times [2024-11-10 23:05:57,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129327288] [2024-11-10 23:05:57,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:57,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1887734448, now seen corresponding path program 2 times [2024-11-10 23:05:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540844721] [2024-11-10 23:05:57,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 23:05:57,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:57,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540844721] [2024-11-10 23:05:57,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540844721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:05:57,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131990783] [2024-11-10 23:05:57,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 23:05:57,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:05:57,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:57,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:05:57,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 23:05:57,398 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 23:05:57,400 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:05:57,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 23:05:57,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:05:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131990783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:05:57,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:05:57,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-11-10 23:05:57,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056499466] [2024-11-10 23:05:57,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:05:57,527 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:57,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 23:05:57,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 23:05:57,527 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. cyclomatic complexity: 4 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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-10 23:05:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:57,668 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2024-11-10 23:05:57,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 66 transitions. [2024-11-10 23:05:57,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2024-11-10 23:05:57,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 66 transitions. [2024-11-10 23:05:57,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2024-11-10 23:05:57,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-11-10 23:05:57,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 66 transitions. [2024-11-10 23:05:57,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:57,671 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-10 23:05:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 66 transitions. [2024-11-10 23:05:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2024-11-10 23:05:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 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-10 23:05:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-11-10 23:05:57,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-11-10 23:05:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 23:05:57,677 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-11-10 23:05:57,677 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 23:05:57,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 50 transitions. [2024-11-10 23:05:57,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2024-11-10 23:05:57,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:57,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:57,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:57,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 12, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:57,678 INFO L745 eck$LassoCheckResult]: Stem: 574#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 575#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 573#L22 [2024-11-10 23:05:57,678 INFO L747 eck$LassoCheckResult]: Loop: 573#L22 assume true; 584#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 585#L23 assume true; 587#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 588#L24 assume true; 607#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 606#L25 assume true; 605#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 604#L25 assume true; 603#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 602#L25 assume true; 601#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 600#L25 assume true; 599#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 598#L25 assume true; 597#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 596#L25 assume true; 595#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 594#L25 assume true; 593#L25-2 assume !(main_~d~0#1 < 6); 580#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 581#L24 assume true; 576#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 577#L25 assume true; 586#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 578#L25 assume true; 579#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 617#L25 assume true; 616#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 615#L25 assume true; 614#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 613#L25 assume true; 612#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 611#L25 assume true; 610#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 609#L25 assume true; 608#L25-2 assume !(main_~d~0#1 < 6); 592#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 591#L24 assume true; 590#L24-2 assume !(main_~c~0#1 < 6); 582#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 583#L23 assume true; 589#L23-2 assume !(main_~b~0#1 < 6); 572#L22-1 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 573#L22 [2024-11-10 23:05:57,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2048, now seen corresponding path program 7 times [2024-11-10 23:05:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535452206] [2024-11-10 23:05:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:57,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash -515356418, now seen corresponding path program 3 times [2024-11-10 23:05:57,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089007306] [2024-11-10 23:05:57,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-10 23:05:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089007306] [2024-11-10 23:05:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089007306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:05:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614145060] [2024-11-10 23:05:57,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 23:05:57,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:05:57,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:57,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:05:57,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 23:05:57,799 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 23:05:57,799 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:05:57,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 23:05:57,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-10 23:05:57,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:05:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-10 23:05:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614145060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:05:57,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:05:57,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-10 23:05:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539745484] [2024-11-10 23:05:57,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:05:57,944 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:57,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 23:05:57,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 23:05:57,945 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-10 23:05:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:57,973 INFO L93 Difference]: Finished difference Result 163 states and 176 transitions. [2024-11-10 23:05:57,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 176 transitions. [2024-11-10 23:05:57,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 161 [2024-11-10 23:05:57,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 163 states and 176 transitions. [2024-11-10 23:05:57,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2024-11-10 23:05:57,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2024-11-10 23:05:57,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 176 transitions. [2024-11-10 23:05:57,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:57,978 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 176 transitions. [2024-11-10 23:05:57,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 176 transitions. [2024-11-10 23:05:57,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-10 23:05:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 163 states have (on average 1.0797546012269938) internal successors, (176), 162 states have internal predecessors, (176), 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-10 23:05:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2024-11-10 23:05:57,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 176 transitions. [2024-11-10 23:05:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 23:05:57,989 INFO L425 stractBuchiCegarLoop]: Abstraction has 163 states and 176 transitions. [2024-11-10 23:05:57,990 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 23:05:57,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 176 transitions. [2024-11-10 23:05:57,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 161 [2024-11-10 23:05:57,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:57,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:57,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:57,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [56, 48, 12, 8, 8, 8, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-10 23:05:57,993 INFO L745 eck$LassoCheckResult]: Stem: 1050#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 1051#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 1049#L22 [2024-11-10 23:05:57,995 INFO L747 eck$LassoCheckResult]: Loop: 1049#L22 assume true; 1060#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1061#L23 assume true; 1210#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1209#L24 assume true; 1208#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 1054#L25 assume true; 1055#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1062#L25 assume true; 1205#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1203#L25 assume true; 1201#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1199#L25 assume true; 1197#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1195#L25 assume true; 1193#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1191#L25 assume true; 1189#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1187#L25 assume true; 1186#L25-2 assume !(main_~d~0#1 < 6); 1056#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 1057#L24 assume true; 1181#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 1149#L25 assume true; 1179#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1177#L25 assume true; 1175#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1173#L25 assume true; 1171#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1169#L25 assume true; 1167#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1165#L25 assume true; 1163#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1161#L25 assume true; 1159#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1157#L25 assume true; 1156#L25-2 assume !(main_~d~0#1 < 6); 1153#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 1151#L24 assume true; 1148#L24-2 assume !(main_~c~0#1 < 6); 1058#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 1059#L23 assume true; 1063#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1064#L24 assume true; 1052#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 1053#L25 assume true; 1207#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1206#L25 assume true; 1204#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1202#L25 assume true; 1200#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1198#L25 assume true; 1196#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1194#L25 assume true; 1192#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1190#L25 assume true; 1188#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1185#L25 assume true; 1184#L25-2 assume !(main_~d~0#1 < 6); 1183#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 1182#L24 assume true; 1180#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 1147#L25 assume true; 1178#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1176#L25 assume true; 1174#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1172#L25 assume true; 1170#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1168#L25 assume true; 1166#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1164#L25 assume true; 1162#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1160#L25 assume true; 1158#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1155#L25 assume true; 1154#L25-2 assume !(main_~d~0#1 < 6); 1152#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 1150#L24 assume true; 1146#L24-2 assume !(main_~c~0#1 < 6); 1145#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 1144#L23 assume true; 1143#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1142#L24 assume true; 1141#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 1140#L25 assume true; 1139#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1138#L25 assume true; 1137#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1136#L25 assume true; 1135#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1134#L25 assume true; 1133#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1132#L25 assume true; 1131#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1130#L25 assume true; 1129#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1128#L25 assume true; 1127#L25-2 assume !(main_~d~0#1 < 6); 1126#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 1125#L24 assume true; 1124#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 1108#L25 assume true; 1123#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1122#L25 assume true; 1121#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1120#L25 assume true; 1119#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1118#L25 assume true; 1117#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1116#L25 assume true; 1115#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1114#L25 assume true; 1113#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1112#L25 assume true; 1111#L25-2 assume !(main_~d~0#1 < 6); 1110#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 1109#L24 assume true; 1107#L24-2 assume !(main_~c~0#1 < 6); 1106#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 1105#L23 assume true; 1104#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1066#L24 assume true; 1103#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 1102#L25 assume true; 1101#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1100#L25 assume true; 1099#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1098#L25 assume true; 1097#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1096#L25 assume true; 1095#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1094#L25 assume true; 1093#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1092#L25 assume true; 1091#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1090#L25 assume true; 1089#L25-2 assume !(main_~d~0#1 < 6); 1088#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 1087#L24 assume true; 1086#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 1070#L25 assume true; 1085#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1084#L25 assume true; 1083#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1082#L25 assume true; 1081#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1080#L25 assume true; 1079#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1078#L25 assume true; 1077#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1076#L25 assume true; 1075#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 1074#L25 assume true; 1073#L25-2 assume !(main_~d~0#1 < 6); 1072#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 1071#L24 assume true; 1069#L24-2 assume !(main_~c~0#1 < 6); 1068#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 1067#L23 assume true; 1065#L23-2 assume !(main_~b~0#1 < 6); 1048#L22-1 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 1049#L22 [2024-11-10 23:05:57,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2048, now seen corresponding path program 8 times [2024-11-10 23:05:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691358708] [2024-11-10 23:05:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:58,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1408396887, now seen corresponding path program 4 times [2024-11-10 23:05:58,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:58,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637738326] [2024-11-10 23:05:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:58,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3266 backedges. 1250 proven. 105 refuted. 0 times theorem prover too weak. 1911 trivial. 0 not checked. [2024-11-10 23:05:58,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:58,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637738326] [2024-11-10 23:05:58,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637738326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:05:58,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251249830] [2024-11-10 23:05:58,156 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 23:05:58,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:05:58,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:58,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:05:58,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 23:05:58,227 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 23:05:58,227 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:05:58,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:05:58,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3266 backedges. 1250 proven. 105 refuted. 0 times theorem prover too weak. 1911 trivial. 0 not checked. [2024-11-10 23:05:58,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:05:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3266 backedges. 1250 proven. 105 refuted. 0 times theorem prover too weak. 1911 trivial. 0 not checked. [2024-11-10 23:05:58,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251249830] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:05:58,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:05:58,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-10 23:05:58,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842640863] [2024-11-10 23:05:58,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:05:58,359 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:58,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:58,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 23:05:58,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-10 23:05:58,362 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-10 23:05:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:58,388 INFO L93 Difference]: Finished difference Result 435 states and 464 transitions. [2024-11-10 23:05:58,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 435 states and 464 transitions. [2024-11-10 23:05:58,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 433 [2024-11-10 23:05:58,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 435 states to 435 states and 464 transitions. [2024-11-10 23:05:58,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 435 [2024-11-10 23:05:58,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 435 [2024-11-10 23:05:58,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 435 states and 464 transitions. [2024-11-10 23:05:58,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:58,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 435 states and 464 transitions. [2024-11-10 23:05:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states and 464 transitions. [2024-11-10 23:05:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2024-11-10 23:05:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 435 states have (on average 1.0666666666666667) internal successors, (464), 434 states have internal predecessors, (464), 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-10 23:05:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 464 transitions. [2024-11-10 23:05:58,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 435 states and 464 transitions. [2024-11-10 23:05:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 23:05:58,418 INFO L425 stractBuchiCegarLoop]: Abstraction has 435 states and 464 transitions. [2024-11-10 23:05:58,418 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 23:05:58,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 435 states and 464 transitions. [2024-11-10 23:05:58,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 433 [2024-11-10 23:05:58,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:58,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:58,422 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:58,422 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [168, 144, 28, 24, 24, 24, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-10 23:05:58,422 INFO L745 eck$LassoCheckResult]: Stem: 2617#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 2618#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 2620#L22 [2024-11-10 23:05:58,423 INFO L747 eck$LassoCheckResult]: Loop: 2620#L22 assume true; 2624#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2625#L23 assume true; 2631#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2632#L24 assume true; 2621#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2622#L25 assume true; 2623#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2630#L25 assume true; 3045#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3043#L25 assume true; 3041#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3039#L25 assume true; 3037#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3035#L25 assume true; 3033#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3031#L25 assume true; 3029#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3027#L25 assume true; 3026#L25-2 assume !(main_~d~0#1 < 6); 2626#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2627#L24 assume true; 3021#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 3019#L25 assume true; 3017#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3015#L25 assume true; 3013#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3011#L25 assume true; 3009#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3007#L25 assume true; 3005#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3003#L25 assume true; 3001#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2999#L25 assume true; 2997#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2995#L25 assume true; 2994#L25-2 assume !(main_~d~0#1 < 6); 2991#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2989#L24 assume true; 2987#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2985#L25 assume true; 2983#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2981#L25 assume true; 2979#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2977#L25 assume true; 2975#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2973#L25 assume true; 2971#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2969#L25 assume true; 2967#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2965#L25 assume true; 2963#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2961#L25 assume true; 2960#L25-2 assume !(main_~d~0#1 < 6); 2957#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2955#L24 assume true; 2953#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2951#L25 assume true; 2949#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2947#L25 assume true; 2945#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2943#L25 assume true; 2941#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2939#L25 assume true; 2937#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2935#L25 assume true; 2933#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2931#L25 assume true; 2929#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2927#L25 assume true; 2926#L25-2 assume !(main_~d~0#1 < 6); 2923#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2921#L24 assume true; 2919#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2917#L25 assume true; 2915#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2913#L25 assume true; 2911#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2909#L25 assume true; 2907#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2905#L25 assume true; 2903#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2901#L25 assume true; 2899#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2897#L25 assume true; 2895#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2893#L25 assume true; 2892#L25-2 assume !(main_~d~0#1 < 6); 2889#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2887#L24 assume true; 2885#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2853#L25 assume true; 2883#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2881#L25 assume true; 2879#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2877#L25 assume true; 2875#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2873#L25 assume true; 2871#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2869#L25 assume true; 2867#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2865#L25 assume true; 2863#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2861#L25 assume true; 2860#L25-2 assume !(main_~d~0#1 < 6); 2857#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2855#L24 assume true; 2852#L24-2 assume !(main_~c~0#1 < 6); 2628#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2629#L23 assume true; 3051#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3050#L24 assume true; 3049#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 3048#L25 assume true; 3047#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3046#L25 assume true; 3044#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3042#L25 assume true; 3040#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3038#L25 assume true; 3036#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3034#L25 assume true; 3032#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3030#L25 assume true; 3028#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3025#L25 assume true; 3024#L25-2 assume !(main_~d~0#1 < 6); 3023#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 3022#L24 assume true; 3020#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 3018#L25 assume true; 3016#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3014#L25 assume true; 3012#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3010#L25 assume true; 3008#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3006#L25 assume true; 3004#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 3002#L25 assume true; 3000#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2998#L25 assume true; 2996#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2993#L25 assume true; 2992#L25-2 assume !(main_~d~0#1 < 6); 2990#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2988#L24 assume true; 2986#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2984#L25 assume true; 2982#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2980#L25 assume true; 2978#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2976#L25 assume true; 2974#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2972#L25 assume true; 2970#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2968#L25 assume true; 2966#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2964#L25 assume true; 2962#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2959#L25 assume true; 2958#L25-2 assume !(main_~d~0#1 < 6); 2956#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2954#L24 assume true; 2952#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2950#L25 assume true; 2948#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2946#L25 assume true; 2944#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2942#L25 assume true; 2940#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2938#L25 assume true; 2936#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2934#L25 assume true; 2932#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2930#L25 assume true; 2928#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2925#L25 assume true; 2924#L25-2 assume !(main_~d~0#1 < 6); 2922#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2920#L24 assume true; 2918#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2916#L25 assume true; 2914#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2912#L25 assume true; 2910#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2908#L25 assume true; 2906#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2904#L25 assume true; 2902#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2900#L25 assume true; 2898#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2896#L25 assume true; 2894#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2891#L25 assume true; 2890#L25-2 assume !(main_~d~0#1 < 6); 2888#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2886#L24 assume true; 2884#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2851#L25 assume true; 2882#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2880#L25 assume true; 2878#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2876#L25 assume true; 2874#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2872#L25 assume true; 2870#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2868#L25 assume true; 2866#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2864#L25 assume true; 2862#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2859#L25 assume true; 2858#L25-2 assume !(main_~d~0#1 < 6); 2856#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2854#L24 assume true; 2850#L24-2 assume !(main_~c~0#1 < 6); 2849#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2848#L23 assume true; 2847#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2846#L24 assume true; 2845#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2844#L25 assume true; 2843#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2842#L25 assume true; 2841#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2840#L25 assume true; 2839#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2838#L25 assume true; 2837#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2836#L25 assume true; 2835#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2834#L25 assume true; 2833#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2832#L25 assume true; 2831#L25-2 assume !(main_~d~0#1 < 6); 2830#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2829#L24 assume true; 2828#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2827#L25 assume true; 2826#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2825#L25 assume true; 2824#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2823#L25 assume true; 2822#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2821#L25 assume true; 2820#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2819#L25 assume true; 2818#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2817#L25 assume true; 2816#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2815#L25 assume true; 2814#L25-2 assume !(main_~d~0#1 < 6); 2813#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2812#L24 assume true; 2811#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2810#L25 assume true; 2809#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2808#L25 assume true; 2807#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2806#L25 assume true; 2805#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2804#L25 assume true; 2803#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2802#L25 assume true; 2801#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2800#L25 assume true; 2799#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2798#L25 assume true; 2797#L25-2 assume !(main_~d~0#1 < 6); 2796#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2795#L24 assume true; 2794#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2793#L25 assume true; 2792#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2791#L25 assume true; 2790#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2789#L25 assume true; 2788#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2787#L25 assume true; 2786#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2785#L25 assume true; 2784#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2783#L25 assume true; 2782#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2781#L25 assume true; 2780#L25-2 assume !(main_~d~0#1 < 6); 2779#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2778#L24 assume true; 2777#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2776#L25 assume true; 2775#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2774#L25 assume true; 2773#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2772#L25 assume true; 2771#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2770#L25 assume true; 2769#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2768#L25 assume true; 2767#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2766#L25 assume true; 2765#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2764#L25 assume true; 2763#L25-2 assume !(main_~d~0#1 < 6); 2762#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2761#L24 assume true; 2760#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2744#L25 assume true; 2759#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2758#L25 assume true; 2757#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2756#L25 assume true; 2755#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2754#L25 assume true; 2753#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2752#L25 assume true; 2751#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2750#L25 assume true; 2749#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2748#L25 assume true; 2747#L25-2 assume !(main_~d~0#1 < 6); 2746#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2745#L24 assume true; 2743#L24-2 assume !(main_~c~0#1 < 6); 2742#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2741#L23 assume true; 2740#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2634#L24 assume true; 2739#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2738#L25 assume true; 2737#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2736#L25 assume true; 2735#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2734#L25 assume true; 2733#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2732#L25 assume true; 2731#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2730#L25 assume true; 2729#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2728#L25 assume true; 2727#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2726#L25 assume true; 2725#L25-2 assume !(main_~d~0#1 < 6); 2724#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2723#L24 assume true; 2722#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2721#L25 assume true; 2720#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2719#L25 assume true; 2718#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2717#L25 assume true; 2716#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2715#L25 assume true; 2714#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2713#L25 assume true; 2712#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2711#L25 assume true; 2710#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2709#L25 assume true; 2708#L25-2 assume !(main_~d~0#1 < 6); 2707#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2706#L24 assume true; 2705#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2704#L25 assume true; 2703#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2702#L25 assume true; 2701#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2700#L25 assume true; 2699#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2698#L25 assume true; 2697#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2696#L25 assume true; 2695#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2694#L25 assume true; 2693#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2692#L25 assume true; 2691#L25-2 assume !(main_~d~0#1 < 6); 2690#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2689#L24 assume true; 2688#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2687#L25 assume true; 2686#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2685#L25 assume true; 2684#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2683#L25 assume true; 2682#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2681#L25 assume true; 2680#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2679#L25 assume true; 2678#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2677#L25 assume true; 2676#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2675#L25 assume true; 2674#L25-2 assume !(main_~d~0#1 < 6); 2673#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2672#L24 assume true; 2671#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2670#L25 assume true; 2669#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2668#L25 assume true; 2667#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2666#L25 assume true; 2665#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2664#L25 assume true; 2663#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2662#L25 assume true; 2661#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2660#L25 assume true; 2659#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2658#L25 assume true; 2657#L25-2 assume !(main_~d~0#1 < 6); 2656#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2655#L24 assume true; 2654#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2638#L25 assume true; 2653#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2652#L25 assume true; 2651#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2650#L25 assume true; 2649#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2648#L25 assume true; 2647#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2646#L25 assume true; 2645#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2644#L25 assume true; 2643#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2642#L25 assume true; 2641#L25-2 assume !(main_~d~0#1 < 6); 2640#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2639#L24 assume true; 2637#L24-2 assume !(main_~c~0#1 < 6); 2636#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2635#L23 assume true; 2633#L23-2 assume !(main_~b~0#1 < 6); 2619#L22-1 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 2620#L22 [2024-11-10 23:05:58,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:58,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2048, now seen corresponding path program 9 times [2024-11-10 23:05:58,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:58,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923267950] [2024-11-10 23:05:58,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:58,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:58,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:58,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1011623593, now seen corresponding path program 5 times [2024-11-10 23:05:58,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:58,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744386381] [2024-11-10 23:05:58,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:58,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 29114 backedges. 0 proven. 21998 refuted. 0 times theorem prover too weak. 7116 trivial. 0 not checked. [2024-11-10 23:05:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744386381] [2024-11-10 23:05:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744386381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:05:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413290435] [2024-11-10 23:05:58,806 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 23:05:58,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:05:58,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:58,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:05:58,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 23:05:58,966 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2024-11-10 23:05:58,966 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:05:58,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 23:05:58,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 29114 backedges. 0 proven. 21998 refuted. 0 times theorem prover too weak. 7116 trivial. 0 not checked. [2024-11-10 23:05:59,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:05:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 29114 backedges. 0 proven. 21998 refuted. 0 times theorem prover too weak. 7116 trivial. 0 not checked. [2024-11-10 23:05:59,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413290435] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:05:59,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:05:59,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-10 23:05:59,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586395132] [2024-11-10 23:05:59,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:05:59,910 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:59,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:59,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 23:05:59,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-10 23:05:59,911 INFO L87 Difference]: Start difference. First operand 435 states and 464 transitions. cyclomatic complexity: 30 Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-10 23:05:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:59,933 INFO L93 Difference]: Finished difference Result 649 states and 692 transitions. [2024-11-10 23:05:59,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 649 states and 692 transitions. [2024-11-10 23:05:59,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 647 [2024-11-10 23:05:59,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 649 states to 649 states and 692 transitions. [2024-11-10 23:05:59,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 649 [2024-11-10 23:05:59,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 649 [2024-11-10 23:05:59,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 649 states and 692 transitions. [2024-11-10 23:05:59,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:59,940 INFO L218 hiAutomatonCegarLoop]: Abstraction has 649 states and 692 transitions. [2024-11-10 23:05:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states and 692 transitions. [2024-11-10 23:05:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2024-11-10 23:05:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 649 states have (on average 1.066255778120185) internal successors, (692), 648 states have internal predecessors, (692), 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-10 23:05:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 692 transitions. [2024-11-10 23:05:59,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 649 states and 692 transitions. [2024-11-10 23:05:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 23:05:59,951 INFO L425 stractBuchiCegarLoop]: Abstraction has 649 states and 692 transitions. [2024-11-10 23:05:59,951 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 23:05:59,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 649 states and 692 transitions. [2024-11-10 23:05:59,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 647 [2024-11-10 23:05:59,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:59,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:59,955 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:59,955 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [252, 216, 42, 36, 36, 36, 7, 6, 6, 6, 1, 1, 1, 1] [2024-11-10 23:05:59,956 INFO L745 eck$LassoCheckResult]: Stem: 6306#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 6307#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 6305#L22 [2024-11-10 23:05:59,956 INFO L747 eck$LassoCheckResult]: Loop: 6305#L22 assume true; 6316#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 6317#L23 assume true; 6952#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 6951#L24 assume true; 6950#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6310#L25 assume true; 6311#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6318#L25 assume true; 6947#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6945#L25 assume true; 6943#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6941#L25 assume true; 6939#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6937#L25 assume true; 6935#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6933#L25 assume true; 6931#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6929#L25 assume true; 6928#L25-2 assume !(main_~d~0#1 < 6); 6312#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6313#L24 assume true; 6923#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6921#L25 assume true; 6919#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6917#L25 assume true; 6915#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6913#L25 assume true; 6911#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6909#L25 assume true; 6907#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6905#L25 assume true; 6903#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6901#L25 assume true; 6899#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6897#L25 assume true; 6896#L25-2 assume !(main_~d~0#1 < 6); 6893#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6891#L24 assume true; 6889#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6887#L25 assume true; 6885#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6883#L25 assume true; 6881#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6879#L25 assume true; 6877#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6875#L25 assume true; 6873#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6871#L25 assume true; 6869#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6867#L25 assume true; 6865#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6863#L25 assume true; 6862#L25-2 assume !(main_~d~0#1 < 6); 6859#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6857#L24 assume true; 6855#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6853#L25 assume true; 6851#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6849#L25 assume true; 6847#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6845#L25 assume true; 6843#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6841#L25 assume true; 6839#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6837#L25 assume true; 6835#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6833#L25 assume true; 6831#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6829#L25 assume true; 6828#L25-2 assume !(main_~d~0#1 < 6); 6825#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6823#L24 assume true; 6821#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6819#L25 assume true; 6817#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6815#L25 assume true; 6813#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6811#L25 assume true; 6809#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6807#L25 assume true; 6805#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6803#L25 assume true; 6801#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6799#L25 assume true; 6797#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6795#L25 assume true; 6794#L25-2 assume !(main_~d~0#1 < 6); 6791#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6789#L24 assume true; 6787#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6755#L25 assume true; 6785#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6783#L25 assume true; 6781#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6779#L25 assume true; 6777#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6775#L25 assume true; 6773#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6771#L25 assume true; 6769#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6767#L25 assume true; 6765#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6763#L25 assume true; 6762#L25-2 assume !(main_~d~0#1 < 6); 6759#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6757#L24 assume true; 6754#L24-2 assume !(main_~c~0#1 < 6); 6314#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 6315#L23 assume true; 6319#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 6320#L24 assume true; 6308#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6309#L25 assume true; 6949#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6948#L25 assume true; 6946#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6944#L25 assume true; 6942#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6940#L25 assume true; 6938#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6936#L25 assume true; 6934#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6932#L25 assume true; 6930#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6927#L25 assume true; 6926#L25-2 assume !(main_~d~0#1 < 6); 6925#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6924#L24 assume true; 6922#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6920#L25 assume true; 6918#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6916#L25 assume true; 6914#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6912#L25 assume true; 6910#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6908#L25 assume true; 6906#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6904#L25 assume true; 6902#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6900#L25 assume true; 6898#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6895#L25 assume true; 6894#L25-2 assume !(main_~d~0#1 < 6); 6892#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6890#L24 assume true; 6888#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6886#L25 assume true; 6884#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6882#L25 assume true; 6880#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6878#L25 assume true; 6876#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6874#L25 assume true; 6872#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6870#L25 assume true; 6868#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6866#L25 assume true; 6864#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6861#L25 assume true; 6860#L25-2 assume !(main_~d~0#1 < 6); 6858#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6856#L24 assume true; 6854#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6852#L25 assume true; 6850#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6848#L25 assume true; 6846#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6844#L25 assume true; 6842#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6840#L25 assume true; 6838#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6836#L25 assume true; 6834#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6832#L25 assume true; 6830#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6827#L25 assume true; 6826#L25-2 assume !(main_~d~0#1 < 6); 6824#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6822#L24 assume true; 6820#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6818#L25 assume true; 6816#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6814#L25 assume true; 6812#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6810#L25 assume true; 6808#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6806#L25 assume true; 6804#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6802#L25 assume true; 6800#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6798#L25 assume true; 6796#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6793#L25 assume true; 6792#L25-2 assume !(main_~d~0#1 < 6); 6790#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6788#L24 assume true; 6786#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6753#L25 assume true; 6784#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6782#L25 assume true; 6780#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6778#L25 assume true; 6776#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6774#L25 assume true; 6772#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6770#L25 assume true; 6768#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6766#L25 assume true; 6764#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6761#L25 assume true; 6760#L25-2 assume !(main_~d~0#1 < 6); 6758#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6756#L24 assume true; 6752#L24-2 assume !(main_~c~0#1 < 6); 6751#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 6750#L23 assume true; 6749#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 6748#L24 assume true; 6747#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6746#L25 assume true; 6745#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6744#L25 assume true; 6743#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6742#L25 assume true; 6741#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6740#L25 assume true; 6739#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6738#L25 assume true; 6737#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6736#L25 assume true; 6735#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6734#L25 assume true; 6733#L25-2 assume !(main_~d~0#1 < 6); 6732#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6731#L24 assume true; 6730#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6729#L25 assume true; 6728#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6727#L25 assume true; 6726#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6725#L25 assume true; 6724#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6723#L25 assume true; 6722#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6721#L25 assume true; 6720#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6719#L25 assume true; 6718#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6717#L25 assume true; 6716#L25-2 assume !(main_~d~0#1 < 6); 6715#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6714#L24 assume true; 6713#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6712#L25 assume true; 6711#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6710#L25 assume true; 6709#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6708#L25 assume true; 6707#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6706#L25 assume true; 6705#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6704#L25 assume true; 6703#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6702#L25 assume true; 6701#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6700#L25 assume true; 6699#L25-2 assume !(main_~d~0#1 < 6); 6698#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6697#L24 assume true; 6696#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6695#L25 assume true; 6694#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6693#L25 assume true; 6692#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6691#L25 assume true; 6690#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6689#L25 assume true; 6688#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6687#L25 assume true; 6686#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6685#L25 assume true; 6684#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6683#L25 assume true; 6682#L25-2 assume !(main_~d~0#1 < 6); 6681#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6680#L24 assume true; 6679#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6678#L25 assume true; 6677#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6676#L25 assume true; 6675#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6674#L25 assume true; 6673#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6672#L25 assume true; 6671#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6670#L25 assume true; 6669#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6668#L25 assume true; 6667#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6666#L25 assume true; 6665#L25-2 assume !(main_~d~0#1 < 6); 6664#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6663#L24 assume true; 6662#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6646#L25 assume true; 6661#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6660#L25 assume true; 6659#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6658#L25 assume true; 6657#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6656#L25 assume true; 6655#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6654#L25 assume true; 6653#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6652#L25 assume true; 6651#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6650#L25 assume true; 6649#L25-2 assume !(main_~d~0#1 < 6); 6648#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6647#L24 assume true; 6645#L24-2 assume !(main_~c~0#1 < 6); 6644#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 6643#L23 assume true; 6642#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 6641#L24 assume true; 6640#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6639#L25 assume true; 6638#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6637#L25 assume true; 6636#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6635#L25 assume true; 6634#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6633#L25 assume true; 6632#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6631#L25 assume true; 6630#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6629#L25 assume true; 6628#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6627#L25 assume true; 6626#L25-2 assume !(main_~d~0#1 < 6); 6625#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6624#L24 assume true; 6623#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6622#L25 assume true; 6621#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6620#L25 assume true; 6619#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6618#L25 assume true; 6617#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6616#L25 assume true; 6615#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6614#L25 assume true; 6613#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6612#L25 assume true; 6611#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6610#L25 assume true; 6609#L25-2 assume !(main_~d~0#1 < 6); 6608#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6607#L24 assume true; 6606#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6605#L25 assume true; 6604#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6603#L25 assume true; 6602#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6601#L25 assume true; 6600#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6599#L25 assume true; 6598#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6597#L25 assume true; 6596#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6595#L25 assume true; 6594#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6593#L25 assume true; 6592#L25-2 assume !(main_~d~0#1 < 6); 6591#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6590#L24 assume true; 6589#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6588#L25 assume true; 6587#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6586#L25 assume true; 6585#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6584#L25 assume true; 6583#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6582#L25 assume true; 6581#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6580#L25 assume true; 6579#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6578#L25 assume true; 6577#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6576#L25 assume true; 6575#L25-2 assume !(main_~d~0#1 < 6); 6574#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6573#L24 assume true; 6572#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6571#L25 assume true; 6570#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6569#L25 assume true; 6568#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6567#L25 assume true; 6566#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6565#L25 assume true; 6564#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6563#L25 assume true; 6562#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6561#L25 assume true; 6560#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6559#L25 assume true; 6558#L25-2 assume !(main_~d~0#1 < 6); 6557#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6556#L24 assume true; 6555#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6539#L25 assume true; 6554#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6553#L25 assume true; 6552#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6551#L25 assume true; 6550#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6549#L25 assume true; 6548#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6547#L25 assume true; 6546#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6545#L25 assume true; 6544#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6543#L25 assume true; 6542#L25-2 assume !(main_~d~0#1 < 6); 6541#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6540#L24 assume true; 6538#L24-2 assume !(main_~c~0#1 < 6); 6537#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 6536#L23 assume true; 6535#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 6534#L24 assume true; 6533#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6532#L25 assume true; 6531#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6530#L25 assume true; 6529#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6528#L25 assume true; 6527#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6526#L25 assume true; 6525#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6524#L25 assume true; 6523#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6522#L25 assume true; 6521#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6520#L25 assume true; 6519#L25-2 assume !(main_~d~0#1 < 6); 6518#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6517#L24 assume true; 6516#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6515#L25 assume true; 6514#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6513#L25 assume true; 6512#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6511#L25 assume true; 6510#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6509#L25 assume true; 6508#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6507#L25 assume true; 6506#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6505#L25 assume true; 6504#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6503#L25 assume true; 6502#L25-2 assume !(main_~d~0#1 < 6); 6501#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6500#L24 assume true; 6499#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6498#L25 assume true; 6497#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6496#L25 assume true; 6495#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6494#L25 assume true; 6493#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6492#L25 assume true; 6491#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6490#L25 assume true; 6489#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6488#L25 assume true; 6487#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6486#L25 assume true; 6485#L25-2 assume !(main_~d~0#1 < 6); 6484#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6483#L24 assume true; 6482#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6481#L25 assume true; 6480#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6479#L25 assume true; 6478#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6477#L25 assume true; 6476#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6475#L25 assume true; 6474#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6473#L25 assume true; 6472#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6471#L25 assume true; 6470#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6469#L25 assume true; 6468#L25-2 assume !(main_~d~0#1 < 6); 6467#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6466#L24 assume true; 6465#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6464#L25 assume true; 6463#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6462#L25 assume true; 6461#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6460#L25 assume true; 6459#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6458#L25 assume true; 6457#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6456#L25 assume true; 6455#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6454#L25 assume true; 6453#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6452#L25 assume true; 6451#L25-2 assume !(main_~d~0#1 < 6); 6450#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6449#L24 assume true; 6448#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6432#L25 assume true; 6447#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6446#L25 assume true; 6445#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6444#L25 assume true; 6443#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6442#L25 assume true; 6441#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6440#L25 assume true; 6439#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6438#L25 assume true; 6437#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6436#L25 assume true; 6435#L25-2 assume !(main_~d~0#1 < 6); 6434#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6433#L24 assume true; 6431#L24-2 assume !(main_~c~0#1 < 6); 6430#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 6429#L23 assume true; 6428#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 6322#L24 assume true; 6427#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6426#L25 assume true; 6425#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6424#L25 assume true; 6423#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6422#L25 assume true; 6421#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6420#L25 assume true; 6419#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6418#L25 assume true; 6417#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6416#L25 assume true; 6415#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6414#L25 assume true; 6413#L25-2 assume !(main_~d~0#1 < 6); 6412#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6411#L24 assume true; 6410#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6409#L25 assume true; 6408#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6407#L25 assume true; 6406#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6405#L25 assume true; 6404#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6403#L25 assume true; 6402#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6401#L25 assume true; 6400#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6399#L25 assume true; 6398#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6397#L25 assume true; 6396#L25-2 assume !(main_~d~0#1 < 6); 6395#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6394#L24 assume true; 6393#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6392#L25 assume true; 6391#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6390#L25 assume true; 6389#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6388#L25 assume true; 6387#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6386#L25 assume true; 6385#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6384#L25 assume true; 6383#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6382#L25 assume true; 6381#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6380#L25 assume true; 6379#L25-2 assume !(main_~d~0#1 < 6); 6378#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6377#L24 assume true; 6376#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6375#L25 assume true; 6374#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6373#L25 assume true; 6372#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6371#L25 assume true; 6370#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6369#L25 assume true; 6368#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6367#L25 assume true; 6366#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6365#L25 assume true; 6364#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6363#L25 assume true; 6362#L25-2 assume !(main_~d~0#1 < 6); 6361#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6360#L24 assume true; 6359#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6358#L25 assume true; 6357#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6356#L25 assume true; 6355#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6354#L25 assume true; 6353#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6352#L25 assume true; 6351#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6350#L25 assume true; 6349#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6348#L25 assume true; 6347#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6346#L25 assume true; 6345#L25-2 assume !(main_~d~0#1 < 6); 6344#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6343#L24 assume true; 6342#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 6326#L25 assume true; 6341#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6340#L25 assume true; 6339#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6338#L25 assume true; 6337#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6336#L25 assume true; 6335#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6334#L25 assume true; 6333#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6332#L25 assume true; 6331#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 6330#L25 assume true; 6329#L25-2 assume !(main_~d~0#1 < 6); 6328#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 6327#L24 assume true; 6325#L24-2 assume !(main_~c~0#1 < 6); 6324#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 6323#L23 assume true; 6321#L23-2 assume !(main_~b~0#1 < 6); 6304#L22-1 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 6305#L22 [2024-11-10 23:05:59,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:59,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2048, now seen corresponding path program 10 times [2024-11-10 23:05:59,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:59,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587044508] [2024-11-10 23:05:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:59,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:59,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:59,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:59,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash -687307895, now seen corresponding path program 6 times [2024-11-10 23:05:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540816315] [2024-11-10 23:05:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:00,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:00,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:00,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1177484970, now seen corresponding path program 1 times [2024-11-10 23:06:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:00,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628391613] [2024-11-10 23:06:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:00,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:00,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:12,087 WARN L286 SmtUtils]: Spent 11.63s on a formula simplification. DAG size of input: 1170 DAG size of output: 874 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-10 23:06:13,226 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:13,226 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:13,226 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:13,227 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:13,227 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:06:13,227 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,227 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:13,227 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:13,227 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration10_Loop [2024-11-10 23:06:13,227 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:13,227 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:13,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,309 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:13,309 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:06:13,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,313 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10 23:06:13,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 23:06:13,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:13,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:13,333 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:13,333 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0#1=6} Honda state: {ULTIMATE.start_main_~b~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:13,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,350 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10 23:06:13,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 23:06:13,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:13,352 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:13,364 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:13,364 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~d~0#1=6} Honda state: {ULTIMATE.start_main_~d~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:13,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,376 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10 23:06:13,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 23:06:13,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:13,379 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:13,390 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:13,391 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=6} Honda state: {ULTIMATE.start_main_~c~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:13,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,407 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10 23:06:13,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 23:06:13,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:13,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:13,424 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:13,424 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre6#1=0} Honda state: {ULTIMATE.start_main_#t~pre6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:13,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,436 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10 23:06:13,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 23:06:13,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:13,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:13,450 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:13,450 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:13,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,461 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10 23:06:13,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 23:06:13,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:13,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:13,474 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:13,474 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre7#1=0} Honda state: {ULTIMATE.start_main_#t~pre7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:13,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,485 INFO L229 MonitoredProcess]: Starting monitored process 13 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-10 23:06:13,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 23:06:13,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:13,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:13,496 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:13,497 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:13,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,509 INFO L229 MonitoredProcess]: Starting monitored process 14 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-10 23:06:13,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 23:06:13,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:13,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:13,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-10 23:06:13,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,532 INFO L229 MonitoredProcess]: Starting monitored process 15 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-10 23:06:13,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 23:06:13,533 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:06:13,533 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:13,558 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:06:13,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,562 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:13,562 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:13,562 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:13,562 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:13,563 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:06:13,563 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,563 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:13,563 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:13,563 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration10_Loop [2024-11-10 23:06:13,563 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:13,563 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:13,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:13,613 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:13,617 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:06:13,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,619 INFO L229 MonitoredProcess]: Starting monitored process 16 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-10 23:06:13,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-10 23:06:13,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:13,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:13,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:13,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:13,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:13,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:13,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:13,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:13,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:13,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-10 23:06:13,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,649 INFO L229 MonitoredProcess]: Starting monitored process 17 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-10 23:06:13,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-10 23:06:13,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:13,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:13,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:13,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:13,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:13,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:13,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:13,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:13,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:13,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,676 INFO L229 MonitoredProcess]: Starting monitored process 18 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-10 23:06:13,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-10 23:06:13,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:13,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:13,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:13,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:13,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:13,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:13,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:13,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:13,690 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:13,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-10 23:06:13,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,703 INFO L229 MonitoredProcess]: Starting monitored process 19 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-10 23:06:13,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-10 23:06:13,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:13,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:13,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:13,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:13,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:13,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:13,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:13,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:13,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:13,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,728 INFO L229 MonitoredProcess]: Starting monitored process 20 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-10 23:06:13,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-10 23:06:13,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:13,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:13,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:13,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:13,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:13,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:13,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:13,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:13,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:13,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,755 INFO L229 MonitoredProcess]: Starting monitored process 21 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-10 23:06:13,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-10 23:06:13,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:13,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:13,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:13,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:13,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:13,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:13,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:13,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:13,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:13,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,779 INFO L229 MonitoredProcess]: Starting monitored process 22 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-10 23:06:13,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-10 23:06:13,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:13,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:13,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:13,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:13,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:13,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:13,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:13,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:13,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:13,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-10 23:06:13,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,805 INFO L229 MonitoredProcess]: Starting monitored process 23 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-10 23:06:13,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-10 23:06:13,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:13,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:13,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:13,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:13,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:13,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:13,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:13,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:13,819 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:13,822 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:13,823 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:13,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:13,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:13,825 INFO L229 MonitoredProcess]: Starting monitored process 24 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-10 23:06:13,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-10 23:06:13,828 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:13,828 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:13,828 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:13,828 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:13,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:13,840 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:13,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:13,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:13,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:14,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:14,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:14,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 65661 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65661 trivial. 0 not checked. [2024-11-10 23:06:15,745 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:06:15,746 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 649 states and 692 transitions. cyclomatic complexity: 44 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:15,783 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 649 states and 692 transitions. cyclomatic complexity: 44. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1296 states and 1383 transitions. Complement of second has 6 states. [2024-11-10 23:06:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-10 23:06:15,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 647 letters. [2024-11-10 23:06:15,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:15,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 649 letters. Loop has 647 letters. [2024-11-10 23:06:15,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:15,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 1294 letters. [2024-11-10 23:06:15,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:15,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1296 states and 1383 transitions. [2024-11-10 23:06:15,808 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 242 [2024-11-10 23:06:15,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1296 states to 1295 states and 1382 transitions. [2024-11-10 23:06:15,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 647 [2024-11-10 23:06:15,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 648 [2024-11-10 23:06:15,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1295 states and 1382 transitions. [2024-11-10 23:06:15,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:06:15,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1295 states and 1382 transitions. [2024-11-10 23:06:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states and 1382 transitions. [2024-11-10 23:06:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 758. [2024-11-10 23:06:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 758 states have (on average 1.0686015831134565) internal successors, (810), 757 states have internal predecessors, (810), 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-10 23:06:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 810 transitions. [2024-11-10 23:06:15,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 758 states and 810 transitions. [2024-11-10 23:06:15,824 INFO L425 stractBuchiCegarLoop]: Abstraction has 758 states and 810 transitions. [2024-11-10 23:06:15,824 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-10 23:06:15,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 758 states and 810 transitions. [2024-11-10 23:06:15,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2024-11-10 23:06:15,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:06:15,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:06:15,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-10 23:06:15,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 36, 7, 6, 6, 6, 1, 1, 1, 1] [2024-11-10 23:06:15,827 INFO L745 eck$LassoCheckResult]: Stem: 10218#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 10219#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 10241#L22 assume true; 10230#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 10231#L23 [2024-11-10 23:06:15,827 INFO L747 eck$LassoCheckResult]: Loop: 10231#L23 assume true; 10244#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 10245#L24 assume true; 10222#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 10223#L25 assume true; 10242#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10226#L25 assume true; 10227#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10975#L25 assume true; 10974#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10973#L25 assume true; 10972#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10971#L25 assume true; 10970#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10969#L25 assume true; 10968#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10967#L25 assume true; 10966#L25-2 assume !(main_~d~0#1 < 6); 10234#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 10235#L24 assume true; 10965#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 10964#L25 assume true; 10963#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10962#L25 assume true; 10961#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10960#L25 assume true; 10959#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10958#L25 assume true; 10957#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10956#L25 assume true; 10955#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10954#L25 assume true; 10953#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10952#L25 assume true; 10951#L25-2 assume !(main_~d~0#1 < 6); 10950#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 10949#L24 assume true; 10948#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 10947#L25 assume true; 10946#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10945#L25 assume true; 10944#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10943#L25 assume true; 10942#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10941#L25 assume true; 10940#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10939#L25 assume true; 10938#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10937#L25 assume true; 10936#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10935#L25 assume true; 10934#L25-2 assume !(main_~d~0#1 < 6); 10933#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 10932#L24 assume true; 10931#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 10930#L25 assume true; 10929#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10928#L25 assume true; 10927#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10926#L25 assume true; 10925#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10924#L25 assume true; 10923#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10922#L25 assume true; 10921#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10920#L25 assume true; 10919#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10918#L25 assume true; 10917#L25-2 assume !(main_~d~0#1 < 6); 10916#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 10915#L24 assume true; 10914#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 10913#L25 assume true; 10912#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10911#L25 assume true; 10910#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10909#L25 assume true; 10908#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10907#L25 assume true; 10906#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10905#L25 assume true; 10904#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10903#L25 assume true; 10902#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10901#L25 assume true; 10900#L25-2 assume !(main_~d~0#1 < 6); 10899#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 10898#L24 assume true; 10897#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 10881#L25 assume true; 10896#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10895#L25 assume true; 10894#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10893#L25 assume true; 10892#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10891#L25 assume true; 10890#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10889#L25 assume true; 10888#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10887#L25 assume true; 10886#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 10885#L25 assume true; 10884#L25-2 assume !(main_~d~0#1 < 6); 10883#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 10882#L24 assume true; 10880#L24-2 assume !(main_~c~0#1 < 6); 10238#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 10231#L23 [2024-11-10 23:06:15,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1969119, now seen corresponding path program 1 times [2024-11-10 23:06:15,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:15,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350013788] [2024-11-10 23:06:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:15,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:15,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:15,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:15,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:15,836 INFO L85 PathProgramCache]: Analyzing trace with hash -700005462, now seen corresponding path program 1 times [2024-11-10 23:06:15,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:15,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111054322] [2024-11-10 23:06:15,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:15,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:15,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:15,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:15,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:15,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1175922956, now seen corresponding path program 1 times [2024-11-10 23:06:15,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:15,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203580141] [2024-11-10 23:06:15,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:15,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:15,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:15,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:16,381 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:16,381 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:16,381 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:16,381 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:16,382 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:06:16,382 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,382 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:16,382 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:16,382 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration11_Loop [2024-11-10 23:06:16,382 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:16,382 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:16,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,417 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:16,417 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:06:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:16,418 INFO L229 MonitoredProcess]: Starting monitored process 25 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-10 23:06:16,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-10 23:06:16,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:16,419 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:16,431 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:16,431 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre6#1=0} Honda state: {ULTIMATE.start_main_#t~pre6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:16,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:16,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:16,442 INFO L229 MonitoredProcess]: Starting monitored process 26 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-10 23:06:16,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-10 23:06:16,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:16,444 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:16,454 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:16,454 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:16,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:16,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:16,466 INFO L229 MonitoredProcess]: Starting monitored process 27 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-10 23:06:16,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-10 23:06:16,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:16,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:16,478 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:16,478 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:16,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-10 23:06:16,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:16,489 INFO L229 MonitoredProcess]: Starting monitored process 28 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-10 23:06:16,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-10 23:06:16,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:16,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:16,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:16,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:16,511 INFO L229 MonitoredProcess]: Starting monitored process 29 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-10 23:06:16,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-10 23:06:16,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:06:16,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:16,538 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:06:16,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:16,542 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:16,542 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:16,542 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:16,542 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:16,542 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:06:16,542 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,542 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:16,542 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:16,543 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration11_Loop [2024-11-10 23:06:16,543 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:16,543 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:16,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:16,586 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:16,586 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:06:16,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:16,588 INFO L229 MonitoredProcess]: Starting monitored process 30 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-10 23:06:16,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-10 23:06:16,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:16,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:16,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:16,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:16,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:16,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:16,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:16,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:16,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:16,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:16,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:16,616 INFO L229 MonitoredProcess]: Starting monitored process 31 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-10 23:06:16,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-10 23:06:16,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:16,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:16,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:16,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:16,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:16,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:16,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:16,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:16,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:16,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-10 23:06:16,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:16,642 INFO L229 MonitoredProcess]: Starting monitored process 32 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-10 23:06:16,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-10 23:06:16,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:16,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:16,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:16,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:16,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:16,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:16,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:16,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:16,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:16,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:16,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:16,668 INFO L229 MonitoredProcess]: Starting monitored process 33 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-10 23:06:16,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-10 23:06:16,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:16,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:16,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:16,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:16,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:16,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:16,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:16,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:16,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:16,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:16,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:16,695 INFO L229 MonitoredProcess]: Starting monitored process 34 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-10 23:06:16,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-10 23:06:16,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:16,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:16,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:16,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:16,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:16,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:16,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:16,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:16,709 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:16,711 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:16,711 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:16,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:16,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:16,712 INFO L229 MonitoredProcess]: Starting monitored process 35 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-10 23:06:16,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-10 23:06:16,714 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:16,714 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:16,714 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:16,714 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:16,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:16,726 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:16,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:16,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:16,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:16,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:16,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2024-11-10 23:06:17,033 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:06:17,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 758 states and 810 transitions. cyclomatic complexity: 54 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:17,058 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 758 states and 810 transitions. cyclomatic complexity: 54. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2263 states and 2417 transitions. Complement of second has 7 states. [2024-11-10 23:06:17,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-10 23:06:17,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 107 letters. [2024-11-10 23:06:17,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:17,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 111 letters. Loop has 107 letters. [2024-11-10 23:06:17,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:17,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 214 letters. [2024-11-10 23:06:17,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:17,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2263 states and 2417 transitions. [2024-11-10 23:06:17,072 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 134 [2024-11-10 23:06:17,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2263 states to 1622 states and 1733 transitions. [2024-11-10 23:06:17,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2024-11-10 23:06:17,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2024-11-10 23:06:17,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1622 states and 1733 transitions. [2024-11-10 23:06:17,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:06:17,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1622 states and 1733 transitions. [2024-11-10 23:06:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states and 1733 transitions. [2024-11-10 23:06:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1530. [2024-11-10 23:06:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1530 states have (on average 1.0686274509803921) internal successors, (1635), 1529 states have internal predecessors, (1635), 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-10 23:06:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1635 transitions. [2024-11-10 23:06:17,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1530 states and 1635 transitions. [2024-11-10 23:06:17,091 INFO L425 stractBuchiCegarLoop]: Abstraction has 1530 states and 1635 transitions. [2024-11-10 23:06:17,091 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-10 23:06:17,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1530 states and 1635 transitions. [2024-11-10 23:06:17,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 124 [2024-11-10 23:06:17,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:06:17,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:06:17,096 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-10 23:06:17,096 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2024-11-10 23:06:17,096 INFO L745 eck$LassoCheckResult]: Stem: 13597#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 13598#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 13618#L22 assume true; 13619#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 13731#L23 assume true; 13621#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 13606#L24 [2024-11-10 23:06:17,096 INFO L747 eck$LassoCheckResult]: Loop: 13606#L24 assume true; 13599#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 13600#L25 assume true; 13603#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 13616#L25 assume true; 15124#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 15123#L25 assume true; 15122#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 15121#L25 assume true; 15120#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 15119#L25 assume true; 15118#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 15117#L25 assume true; 15116#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 15115#L25 assume true; 15114#L25-2 assume !(main_~d~0#1 < 6); 13605#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 13606#L24 [2024-11-10 23:06:17,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1892324158, now seen corresponding path program 1 times [2024-11-10 23:06:17,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:17,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412377473] [2024-11-10 23:06:17,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:17,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:17,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1794245681, now seen corresponding path program 1 times [2024-11-10 23:06:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:17,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890204703] [2024-11-10 23:06:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:17,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:17,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash 50508436, now seen corresponding path program 1 times [2024-11-10 23:06:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:17,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841015471] [2024-11-10 23:06:17,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:17,163 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:17,164 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:17,164 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:17,164 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:17,164 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:06:17,164 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,164 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:17,164 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:17,164 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration12_Loop [2024-11-10 23:06:17,164 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:17,164 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:17,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,193 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:17,193 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:06:17,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,195 INFO L229 MonitoredProcess]: Starting monitored process 36 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-10 23:06:17,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-10 23:06:17,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:17,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:17,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:17,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,218 INFO L229 MonitoredProcess]: Starting monitored process 37 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-10 23:06:17,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-10 23:06:17,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:06:17,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:17,250 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:06:17,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-10 23:06:17,254 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:17,254 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:17,254 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:17,254 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:17,254 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:06:17,254 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,254 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:17,254 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:17,254 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration12_Loop [2024-11-10 23:06:17,254 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:17,255 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:17,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,288 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:17,288 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:06:17,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,290 INFO L229 MonitoredProcess]: Starting monitored process 38 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-10 23:06:17,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-10 23:06:17,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:17,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:17,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:17,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:17,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:17,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:17,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:17,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:17,306 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:17,307 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:17,307 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:17,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,309 INFO L229 MonitoredProcess]: Starting monitored process 39 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-10 23:06:17,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-10 23:06:17,310 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:17,310 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:17,310 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:17,310 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:17,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-10 23:06:17,321 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:17,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:17,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:17,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:17,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:17,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-10 23:06:17,389 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:06:17,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1530 states and 1635 transitions. cyclomatic complexity: 140 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10 23:06:17,409 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1530 states and 1635 transitions. cyclomatic complexity: 140. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Result 1875 states and 2005 transitions. Complement of second has 7 states. [2024-11-10 23:06:17,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10 23:06:17,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-10 23:06:17,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 17 letters. [2024-11-10 23:06:17,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:17,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 23 letters. Loop has 17 letters. [2024-11-10 23:06:17,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:17,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 34 letters. [2024-11-10 23:06:17,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:17,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1875 states and 2005 transitions. [2024-11-10 23:06:17,422 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 126 [2024-11-10 23:06:17,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1875 states to 1675 states and 1791 transitions. [2024-11-10 23:06:17,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2024-11-10 23:06:17,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2024-11-10 23:06:17,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1675 states and 1791 transitions. [2024-11-10 23:06:17,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:06:17,429 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1675 states and 1791 transitions. [2024-11-10 23:06:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states and 1791 transitions. [2024-11-10 23:06:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1657. [2024-11-10 23:06:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1657 states have (on average 1.0694025347012674) internal successors, (1772), 1656 states have internal predecessors, (1772), 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-10 23:06:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 1772 transitions. [2024-11-10 23:06:17,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1657 states and 1772 transitions. [2024-11-10 23:06:17,459 INFO L425 stractBuchiCegarLoop]: Abstraction has 1657 states and 1772 transitions. [2024-11-10 23:06:17,459 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-10 23:06:17,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1657 states and 1772 transitions. [2024-11-10 23:06:17,466 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 126 [2024-11-10 23:06:17,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:06:17,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:06:17,466 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:06:17,467 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 23:06:17,467 INFO L745 eck$LassoCheckResult]: Stem: 17092#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 17093#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 17115#L22 assume true; 17116#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 17122#L23 assume true; 17118#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 17119#L24 assume true; 17096#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 17097#L25 [2024-11-10 23:06:17,467 INFO L747 eck$LassoCheckResult]: Loop: 17097#L25 assume true; 17100#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 17097#L25 [2024-11-10 23:06:17,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1752350237, now seen corresponding path program 1 times [2024-11-10 23:06:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:17,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323187900] [2024-11-10 23:06:17,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-10 23:06:17,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:17,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:17,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 1 times [2024-11-10 23:06:17,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067605774] [2024-11-10 23:06:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:17,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:17,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash 381398140, now seen corresponding path program 1 times [2024-11-10 23:06:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:17,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009274107] [2024-11-10 23:06:17,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:17,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:17,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-10 23:06:17,498 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:17,498 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:17,498 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:17,498 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:17,498 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:06:17,498 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,499 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:17,499 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:17,499 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration13_Loop [2024-11-10 23:06:17,499 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:17,499 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:17,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,515 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:17,515 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:06:17,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,517 INFO L229 MonitoredProcess]: Starting monitored process 40 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-10 23:06:17,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-10 23:06:17,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:17,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:17,530 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:17,530 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:17,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:17,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,541 INFO L229 MonitoredProcess]: Starting monitored process 41 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-10 23:06:17,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-10 23:06:17,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:17,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:17,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-10 23:06:17,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,565 INFO L229 MonitoredProcess]: Starting monitored process 42 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-10 23:06:17,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-10 23:06:17,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:06:17,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:17,595 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:06:17,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-10 23:06:17,599 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:17,599 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:17,599 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:17,599 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:17,599 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:06:17,599 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,599 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:17,599 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:17,599 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration13_Loop [2024-11-10 23:06:17,599 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:17,599 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:17,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,612 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:17,612 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:06:17,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,613 INFO L229 MonitoredProcess]: Starting monitored process 43 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-10 23:06:17,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-10 23:06:17,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:17,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:17,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:17,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:17,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:17,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:17,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:17,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:17,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:17,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:17,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,637 INFO L229 MonitoredProcess]: Starting monitored process 44 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-10 23:06:17,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-10 23:06:17,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:17,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:17,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:17,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:17,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:17,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:17,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:17,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:17,651 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:17,652 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:17,652 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:17,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,653 INFO L229 MonitoredProcess]: Starting monitored process 45 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-10 23:06:17,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-10 23:06:17,654 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:17,654 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:17,654 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:17,655 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0#1) = -2*ULTIMATE.start_main_~d~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:17,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:17,666 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:17,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:17,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:17,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:17,695 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:17,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:17,696 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-10 23:06:17,696 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 23:06:17,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1657 states and 1772 transitions. cyclomatic complexity: 158 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10 23:06:17,709 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1657 states and 1772 transitions. cyclomatic complexity: 158. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Result 1712 states and 1830 transitions. Complement of second has 5 states. [2024-11-10 23:06:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10 23:06:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-10 23:06:17,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-10 23:06:17,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:17,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-10 23:06:17,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:17,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-10 23:06:17,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:17,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1712 states and 1830 transitions. [2024-11-10 23:06:17,715 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 126 [2024-11-10 23:06:17,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1712 states to 1679 states and 1795 transitions. [2024-11-10 23:06:17,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2024-11-10 23:06:17,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2024-11-10 23:06:17,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1679 states and 1795 transitions. [2024-11-10 23:06:17,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:06:17,719 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1679 states and 1795 transitions. [2024-11-10 23:06:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states and 1795 transitions. [2024-11-10 23:06:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1672. [2024-11-10 23:06:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1672 states have (on average 1.06877990430622) internal successors, (1787), 1671 states have internal predecessors, (1787), 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-10 23:06:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1787 transitions. [2024-11-10 23:06:17,732 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1672 states and 1787 transitions. [2024-11-10 23:06:17,732 INFO L425 stractBuchiCegarLoop]: Abstraction has 1672 states and 1787 transitions. [2024-11-10 23:06:17,732 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-10 23:06:17,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1672 states and 1787 transitions. [2024-11-10 23:06:17,736 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 126 [2024-11-10 23:06:17,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:06:17,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:06:17,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:06:17,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 23:06:17,737 INFO L745 eck$LassoCheckResult]: Stem: 20510#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 20511#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 20534#L22 assume true; 20535#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 20540#L23 assume true; 20542#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 20543#L24 assume true; 20544#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 20715#L25 assume true; 20714#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 20713#L25 assume true; 20712#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 20711#L25 assume true; 20710#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 20709#L25 assume true; 20708#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 20707#L25 assume true; 20706#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 20705#L25 assume true; 20691#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 20692#L25 assume true; 20683#L25-2 assume !(main_~d~0#1 < 6); 20680#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 20678#L24 assume true; 20677#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 20518#L25 [2024-11-10 23:06:17,737 INFO L747 eck$LassoCheckResult]: Loop: 20518#L25 assume true; 20519#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 20518#L25 [2024-11-10 23:06:17,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1293967347, now seen corresponding path program 2 times [2024-11-10 23:06:17,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:17,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29726305] [2024-11-10 23:06:17,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:17,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 2 times [2024-11-10 23:06:17,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:17,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760173634] [2024-11-10 23:06:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:17,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2037894958, now seen corresponding path program 3 times [2024-11-10 23:06:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:17,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633819073] [2024-11-10 23:06:17,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:17,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:17,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:17,762 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:17,762 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:17,762 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:17,762 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:17,762 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:06:17,762 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,762 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:17,762 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:17,762 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration14_Loop [2024-11-10 23:06:17,762 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:17,762 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:17,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,777 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:17,777 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:06:17,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,780 INFO L229 MonitoredProcess]: Starting monitored process 46 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-10 23:06:17,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-10 23:06:17,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:17,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:17,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:17,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,805 INFO L229 MonitoredProcess]: Starting monitored process 47 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-10 23:06:17,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-10 23:06:17,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:06:17,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:17,832 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:06:17,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-10 23:06:17,836 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:17,836 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:17,836 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:17,836 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:17,836 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:06:17,836 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,836 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:17,837 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:17,837 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration14_Loop [2024-11-10 23:06:17,837 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:17,837 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:17,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:17,849 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:17,849 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:06:17,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,850 INFO L229 MonitoredProcess]: Starting monitored process 48 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-10 23:06:17,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-10 23:06:17,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:17,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:17,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:17,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:17,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:17,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:17,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:17,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:17,864 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:17,865 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:17,865 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:17,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:17,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:17,866 INFO L229 MonitoredProcess]: Starting monitored process 49 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-10 23:06:17,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-10 23:06:17,867 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:17,867 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:17,867 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:17,867 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0#1) = -2*ULTIMATE.start_main_~d~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:17,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:17,878 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:17,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:17,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:17,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:17,922 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:17,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:17,923 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-10 23:06:17,923 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 23:06:17,923 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1672 states and 1787 transitions. cyclomatic complexity: 159 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 23:06:17,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1672 states and 1787 transitions. cyclomatic complexity: 159. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Result 1707 states and 1826 transitions. Complement of second has 5 states. [2024-11-10 23:06:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 23:06:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-10 23:06:17,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-10 23:06:17,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:17,933 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:06:17,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:17,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:17,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:17,974 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:17,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:17,975 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-10 23:06:17,975 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 23:06:17,976 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1672 states and 1787 transitions. cyclomatic complexity: 159 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 23:06:17,985 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1672 states and 1787 transitions. cyclomatic complexity: 159. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Result 1707 states and 1826 transitions. Complement of second has 5 states. [2024-11-10 23:06:17,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 23:06:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-10 23:06:17,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-10 23:06:17,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:17,986 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:06:17,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:18,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:18,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:18,024 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:18,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:18,026 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-10 23:06:18,026 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 23:06:18,026 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1672 states and 1787 transitions. cyclomatic complexity: 159 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 23:06:18,038 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1672 states and 1787 transitions. cyclomatic complexity: 159. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Result 2677 states and 2805 transitions. Complement of second has 4 states. [2024-11-10 23:06:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 23:06:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2024-11-10 23:06:18,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-10 23:06:18,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:18,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-10 23:06:18,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:18,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 25 letters. Loop has 4 letters. [2024-11-10 23:06:18,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:18,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2677 states and 2805 transitions. [2024-11-10 23:06:18,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 131 [2024-11-10 23:06:18,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2677 states to 1724 states and 1835 transitions. [2024-11-10 23:06:18,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-10 23:06:18,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-10 23:06:18,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1724 states and 1835 transitions. [2024-11-10 23:06:18,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:06:18,057 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1724 states and 1835 transitions. [2024-11-10 23:06:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states and 1835 transitions. [2024-11-10 23:06:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1635. [2024-11-10 23:06:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1635 states have (on average 1.0678899082568807) internal successors, (1746), 1634 states have internal predecessors, (1746), 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-10 23:06:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1746 transitions. [2024-11-10 23:06:18,070 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1635 states and 1746 transitions. [2024-11-10 23:06:18,070 INFO L425 stractBuchiCegarLoop]: Abstraction has 1635 states and 1746 transitions. [2024-11-10 23:06:18,070 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-10 23:06:18,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1635 states and 1746 transitions. [2024-11-10 23:06:18,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 124 [2024-11-10 23:06:18,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:06:18,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:06:18,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [42, 36, 7, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 23:06:18,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2024-11-10 23:06:18,075 INFO L745 eck$LassoCheckResult]: Stem: 28542#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 28543#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 28564#L22 assume true; 28566#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 28574#L23 assume true; 28575#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 28909#L24 assume true; 28908#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 28907#L25 assume true; 28906#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28905#L25 assume true; 28904#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28903#L25 assume true; 28902#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28901#L25 assume true; 28900#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28899#L25 assume true; 28898#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28897#L25 assume true; 28896#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28895#L25 assume true; 28894#L25-2 assume !(main_~d~0#1 < 6); 28893#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 28892#L24 assume true; 28891#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 28890#L25 assume true; 28889#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28888#L25 assume true; 28887#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28886#L25 assume true; 28885#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28884#L25 assume true; 28883#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28882#L25 assume true; 28881#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28880#L25 assume true; 28862#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28861#L25 assume true; 28860#L25-2 assume !(main_~d~0#1 < 6); 28859#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 28858#L24 assume true; 28857#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 28856#L25 assume true; 28855#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28854#L25 assume true; 28853#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28852#L25 assume true; 28851#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28850#L25 assume true; 28849#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28848#L25 assume true; 28847#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28846#L25 assume true; 28828#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28827#L25 assume true; 28826#L25-2 assume !(main_~d~0#1 < 6); 28825#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 28824#L24 assume true; 28823#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 28822#L25 assume true; 28821#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28820#L25 assume true; 28819#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28818#L25 assume true; 28817#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28816#L25 assume true; 28815#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28814#L25 assume true; 28813#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28812#L25 assume true; 28794#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28793#L25 assume true; 28792#L25-2 assume !(main_~d~0#1 < 6); 28791#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 28790#L24 assume true; 28789#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 28788#L25 assume true; 28787#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28786#L25 assume true; 28785#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28784#L25 assume true; 28783#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28782#L25 assume true; 28781#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28780#L25 assume true; 28779#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28778#L25 assume true; 28760#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28759#L25 assume true; 28756#L25-2 assume !(main_~d~0#1 < 6); 28754#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 28751#L24 assume true; 28750#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 28746#L25 assume true; 28747#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28742#L25 assume true; 28743#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28738#L25 assume true; 28739#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28734#L25 assume true; 28735#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28730#L25 assume true; 28731#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28727#L25 assume true; 28673#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28672#L25 assume true; 28674#L25-2 assume !(main_~d~0#1 < 6); 28629#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 28630#L24 assume true; 28591#L24-2 assume !(main_~c~0#1 < 6); 28590#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 28587#L23 assume true; 28588#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 28558#L24 [2024-11-10 23:06:18,075 INFO L747 eck$LassoCheckResult]: Loop: 28558#L24 assume true; 28704#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 28703#L25 assume true; 28702#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28701#L25 assume true; 28700#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28699#L25 assume true; 28698#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28697#L25 assume true; 28696#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28695#L25 assume true; 28694#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28693#L25 assume true; 28690#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 28689#L25 assume true; 28688#L25-2 assume !(main_~d~0#1 < 6); 28557#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 28558#L24 [2024-11-10 23:06:18,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash 485562667, now seen corresponding path program 2 times [2024-11-10 23:06:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:18,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841746538] [2024-11-10 23:06:18,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:18,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:18,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:18,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1794245681, now seen corresponding path program 2 times [2024-11-10 23:06:18,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:18,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415172377] [2024-11-10 23:06:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:18,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:18,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:18,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:18,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:18,093 INFO L85 PathProgramCache]: Analyzing trace with hash 757408839, now seen corresponding path program 3 times [2024-11-10 23:06:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:18,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748066157] [2024-11-10 23:06:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:18,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:18,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:18,151 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:18,152 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:18,152 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:18,152 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:18,152 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:06:18,152 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,152 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:18,152 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:18,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration15_Loop [2024-11-10 23:06:18,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:18,152 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:18,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:18,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:18,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:18,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:18,178 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:18,178 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:06:18,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:18,179 INFO L229 MonitoredProcess]: Starting monitored process 50 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-10 23:06:18,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-10 23:06:18,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:18,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:18,194 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:18,194 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:18,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-10 23:06:18,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:18,205 INFO L229 MonitoredProcess]: Starting monitored process 51 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-10 23:06:18,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-10 23:06:18,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:18,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:18,219 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:18,219 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~d~0#1=6} Honda state: {ULTIMATE.start_main_~d~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:18,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-10 23:06:18,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:18,231 INFO L229 MonitoredProcess]: Starting monitored process 52 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-10 23:06:18,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-10 23:06:18,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:18,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:18,244 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:18,244 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:18,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:18,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:18,255 INFO L229 MonitoredProcess]: Starting monitored process 53 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-10 23:06:18,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-10 23:06:18,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:18,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:18,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-10 23:06:18,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:18,278 INFO L229 MonitoredProcess]: Starting monitored process 54 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-10 23:06:18,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-10 23:06:18,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:06:18,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:18,305 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:06:18,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-10 23:06:18,309 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:18,309 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:18,309 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:18,309 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:18,309 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:06:18,309 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,309 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:18,309 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:18,309 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration15_Loop [2024-11-10 23:06:18,309 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:18,309 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:18,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:18,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:18,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:18,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:18,336 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:18,336 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:06:18,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:18,339 INFO L229 MonitoredProcess]: Starting monitored process 55 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-10 23:06:18,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-10 23:06:18,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:18,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:18,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:18,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:18,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:18,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:18,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:18,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:18,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:18,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:18,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:18,363 INFO L229 MonitoredProcess]: Starting monitored process 56 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-10 23:06:18,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-10 23:06:18,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:18,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:18,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:18,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:18,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:18,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:18,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:18,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:18,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:18,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-10 23:06:18,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:18,388 INFO L229 MonitoredProcess]: Starting monitored process 57 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-10 23:06:18,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-10 23:06:18,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:18,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:18,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:18,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:18,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:18,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:18,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:18,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:18,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:18,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-10 23:06:18,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:18,415 INFO L229 MonitoredProcess]: Starting monitored process 58 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-10 23:06:18,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-10 23:06:18,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:18,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:18,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:18,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:18,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:18,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:18,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:18,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:18,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:18,431 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:18,431 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:18,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:18,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:18,432 INFO L229 MonitoredProcess]: Starting monitored process 59 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-10 23:06:18,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-10 23:06:18,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:18,433 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:18,433 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:18,433 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:18,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:18,444 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:18,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:18,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:18,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:18,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:18,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:18,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-10 23:06:18,653 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:06:18,653 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1635 states and 1746 transitions. cyclomatic complexity: 152 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-10 23:06:18,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:18,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-10 23:06:18,685 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1635 states and 1746 transitions. cyclomatic complexity: 152. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) Result 1840 states and 1966 transitions. Complement of second has 7 states. [2024-11-10 23:06:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-10 23:06:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-10 23:06:18,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 113 letters. Loop has 17 letters. [2024-11-10 23:06:18,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:18,686 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:06:18,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:18,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:18,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:18,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:18,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-10 23:06:18,867 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:06:18,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1635 states and 1746 transitions. cyclomatic complexity: 152 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-10 23:06:18,883 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1635 states and 1746 transitions. cyclomatic complexity: 152. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) Result 1840 states and 1966 transitions. Complement of second has 7 states. [2024-11-10 23:06:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-10 23:06:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-10 23:06:18,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 113 letters. Loop has 17 letters. [2024-11-10 23:06:18,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:18,884 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:06:18,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:18,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:18,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:19,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:19,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-10 23:06:19,057 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:06:19,057 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1635 states and 1746 transitions. cyclomatic complexity: 152 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-10 23:06:19,078 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1635 states and 1746 transitions. cyclomatic complexity: 152. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) Result 3156 states and 3378 transitions. Complement of second has 6 states. [2024-11-10 23:06:19,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-10 23:06:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2024-11-10 23:06:19,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 113 letters. Loop has 17 letters. [2024-11-10 23:06:19,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:19,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 130 letters. Loop has 17 letters. [2024-11-10 23:06:19,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:19,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 113 letters. Loop has 34 letters. [2024-11-10 23:06:19,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:19,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3156 states and 3378 transitions. [2024-11-10 23:06:19,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2024-11-10 23:06:19,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3156 states to 1415 states and 1509 transitions. [2024-11-10 23:06:19,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-10 23:06:19,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-10 23:06:19,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1415 states and 1509 transitions. [2024-11-10 23:06:19,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:06:19,090 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1415 states and 1509 transitions. [2024-11-10 23:06:19,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states and 1509 transitions. [2024-11-10 23:06:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1403. [2024-11-10 23:06:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1403 states have (on average 1.0669992872416252) internal successors, (1497), 1402 states have internal predecessors, (1497), 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-10 23:06:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1497 transitions. [2024-11-10 23:06:19,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1403 states and 1497 transitions. [2024-11-10 23:06:19,101 INFO L425 stractBuchiCegarLoop]: Abstraction has 1403 states and 1497 transitions. [2024-11-10 23:06:19,101 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-10 23:06:19,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1403 states and 1497 transitions. [2024-11-10 23:06:19,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2024-11-10 23:06:19,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:06:19,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:06:19,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [252, 216, 42, 36, 36, 36, 7, 6, 6, 6, 2, 2, 1, 1, 1, 1] [2024-11-10 23:06:19,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 36, 7, 6, 6, 6, 1, 1, 1, 1] [2024-11-10 23:06:19,114 INFO L745 eck$LassoCheckResult]: Stem: 38221#ULTIMATE.startENTRY 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(11, 2);call #Ultimate.allocInit(12, 3); 38222#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 38240#L22 assume true; 38241#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 39459#L23 assume true; 39458#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 39457#L24 assume true; 39456#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39455#L25 assume true; 39454#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39453#L25 assume true; 39452#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39451#L25 assume true; 39450#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39449#L25 assume true; 39448#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39447#L25 assume true; 39446#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39445#L25 assume true; 39444#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39443#L25 assume true; 39442#L25-2 assume !(main_~d~0#1 < 6); 39441#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39440#L24 assume true; 39439#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39438#L25 assume true; 39437#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39436#L25 assume true; 39435#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39434#L25 assume true; 39433#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39432#L25 assume true; 39431#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39430#L25 assume true; 39429#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39428#L25 assume true; 39427#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39426#L25 assume true; 39425#L25-2 assume !(main_~d~0#1 < 6); 39424#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39423#L24 assume true; 39422#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39421#L25 assume true; 39420#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39419#L25 assume true; 39418#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39417#L25 assume true; 39416#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39415#L25 assume true; 39414#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39413#L25 assume true; 39412#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39411#L25 assume true; 39410#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39409#L25 assume true; 39408#L25-2 assume !(main_~d~0#1 < 6); 39407#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39406#L24 assume true; 39405#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39404#L25 assume true; 39403#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39402#L25 assume true; 39401#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39400#L25 assume true; 39399#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39398#L25 assume true; 39397#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39396#L25 assume true; 39395#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39394#L25 assume true; 39393#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39392#L25 assume true; 39391#L25-2 assume !(main_~d~0#1 < 6); 39390#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39389#L24 assume true; 39388#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39387#L25 assume true; 39386#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39385#L25 assume true; 39384#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39383#L25 assume true; 39382#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39381#L25 assume true; 39380#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39379#L25 assume true; 39378#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39377#L25 assume true; 39376#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39375#L25 assume true; 39374#L25-2 assume !(main_~d~0#1 < 6); 39373#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39372#L24 assume true; 39341#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39371#L25 assume true; 39369#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39367#L25 assume true; 39365#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39363#L25 assume true; 39361#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39359#L25 assume true; 39357#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39355#L25 assume true; 39353#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39351#L25 assume true; 39349#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39348#L25 assume true; 39345#L25-2 assume !(main_~d~0#1 < 6); 39343#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39340#L24 assume true; 39337#L24-2 assume !(main_~c~0#1 < 6); 39335#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 39334#L23 assume true; 39333#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 39332#L24 assume true; 39331#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39330#L25 assume true; 39329#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39328#L25 assume true; 39327#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39326#L25 assume true; 39325#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39324#L25 assume true; 39323#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39322#L25 assume true; 39321#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39320#L25 assume true; 39319#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39318#L25 assume true; 39317#L25-2 assume !(main_~d~0#1 < 6); 39316#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39315#L24 assume true; 39314#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39313#L25 assume true; 39312#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39311#L25 assume true; 39310#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39309#L25 assume true; 39308#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39307#L25 assume true; 39306#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39305#L25 assume true; 39304#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39303#L25 assume true; 39302#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39301#L25 assume true; 39300#L25-2 assume !(main_~d~0#1 < 6); 39299#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39298#L24 assume true; 39297#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39296#L25 assume true; 39295#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39294#L25 assume true; 39293#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39292#L25 assume true; 39291#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39290#L25 assume true; 39289#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39288#L25 assume true; 39287#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39286#L25 assume true; 39285#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39284#L25 assume true; 39283#L25-2 assume !(main_~d~0#1 < 6); 39282#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39281#L24 assume true; 39280#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39279#L25 assume true; 39278#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39277#L25 assume true; 39276#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39275#L25 assume true; 39274#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39273#L25 assume true; 39272#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39271#L25 assume true; 39270#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39269#L25 assume true; 39268#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39267#L25 assume true; 39266#L25-2 assume !(main_~d~0#1 < 6); 39265#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39264#L24 assume true; 39263#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39262#L25 assume true; 39261#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39260#L25 assume true; 39259#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39258#L25 assume true; 39257#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39256#L25 assume true; 39255#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39254#L25 assume true; 39253#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39252#L25 assume true; 39251#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39250#L25 assume true; 39249#L25-2 assume !(main_~d~0#1 < 6); 39248#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39247#L24 assume true; 39124#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39139#L25 assume true; 39138#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39137#L25 assume true; 39136#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39135#L25 assume true; 39134#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39133#L25 assume true; 39132#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39131#L25 assume true; 39130#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39129#L25 assume true; 39128#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39127#L25 assume true; 39126#L25-2 assume !(main_~d~0#1 < 6); 39125#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39123#L24 assume true; 39122#L24-2 assume !(main_~c~0#1 < 6); 39121#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 39120#L23 assume true; 39119#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 39118#L24 assume true; 39117#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39116#L25 assume true; 39115#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39114#L25 assume true; 39113#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39112#L25 assume true; 39111#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39110#L25 assume true; 39109#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39108#L25 assume true; 39107#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39106#L25 assume true; 39105#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39104#L25 assume true; 39103#L25-2 assume !(main_~d~0#1 < 6); 39102#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39101#L24 assume true; 39100#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39099#L25 assume true; 39098#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39097#L25 assume true; 39096#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39095#L25 assume true; 39094#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39093#L25 assume true; 39092#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39091#L25 assume true; 39090#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39089#L25 assume true; 39088#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39087#L25 assume true; 39086#L25-2 assume !(main_~d~0#1 < 6); 39085#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39084#L24 assume true; 39083#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39082#L25 assume true; 39081#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39080#L25 assume true; 39079#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39078#L25 assume true; 39077#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39076#L25 assume true; 39075#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39074#L25 assume true; 39073#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39072#L25 assume true; 39071#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39070#L25 assume true; 39069#L25-2 assume !(main_~d~0#1 < 6); 39068#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39067#L24 assume true; 39066#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39065#L25 assume true; 39064#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39063#L25 assume true; 39062#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39061#L25 assume true; 39060#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39059#L25 assume true; 39058#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39057#L25 assume true; 39056#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39055#L25 assume true; 39054#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39053#L25 assume true; 39052#L25-2 assume !(main_~d~0#1 < 6); 39051#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39050#L24 assume true; 39049#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 39048#L25 assume true; 39047#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39046#L25 assume true; 39045#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39044#L25 assume true; 39043#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39042#L25 assume true; 39041#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39040#L25 assume true; 39039#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39038#L25 assume true; 39037#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 39036#L25 assume true; 39035#L25-2 assume !(main_~d~0#1 < 6); 39034#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 39033#L24 assume true; 38910#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38925#L25 assume true; 38924#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38923#L25 assume true; 38922#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38921#L25 assume true; 38920#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38919#L25 assume true; 38918#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38917#L25 assume true; 38916#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38915#L25 assume true; 38914#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38913#L25 assume true; 38912#L25-2 assume !(main_~d~0#1 < 6); 38911#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38909#L24 assume true; 38908#L24-2 assume !(main_~c~0#1 < 6); 38907#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 38906#L23 assume true; 38905#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 38904#L24 assume true; 38903#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38902#L25 assume true; 38901#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38900#L25 assume true; 38899#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38898#L25 assume true; 38897#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38896#L25 assume true; 38895#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38894#L25 assume true; 38893#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38892#L25 assume true; 38891#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38890#L25 assume true; 38889#L25-2 assume !(main_~d~0#1 < 6); 38888#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38887#L24 assume true; 38886#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38885#L25 assume true; 38884#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38883#L25 assume true; 38882#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38881#L25 assume true; 38880#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38879#L25 assume true; 38878#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38877#L25 assume true; 38876#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38875#L25 assume true; 38874#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38873#L25 assume true; 38872#L25-2 assume !(main_~d~0#1 < 6); 38871#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38870#L24 assume true; 38869#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38868#L25 assume true; 38867#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38866#L25 assume true; 38865#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38864#L25 assume true; 38863#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38862#L25 assume true; 38861#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38860#L25 assume true; 38859#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38858#L25 assume true; 38857#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38856#L25 assume true; 38855#L25-2 assume !(main_~d~0#1 < 6); 38854#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38853#L24 assume true; 38852#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38851#L25 assume true; 38850#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38849#L25 assume true; 38848#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38847#L25 assume true; 38846#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38845#L25 assume true; 38844#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38843#L25 assume true; 38842#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38841#L25 assume true; 38840#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38839#L25 assume true; 38838#L25-2 assume !(main_~d~0#1 < 6); 38837#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38836#L24 assume true; 38835#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38834#L25 assume true; 38833#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38832#L25 assume true; 38831#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38830#L25 assume true; 38829#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38828#L25 assume true; 38827#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38826#L25 assume true; 38825#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38824#L25 assume true; 38823#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38822#L25 assume true; 38821#L25-2 assume !(main_~d~0#1 < 6); 38820#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38819#L24 assume true; 38696#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38711#L25 assume true; 38710#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38709#L25 assume true; 38708#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38707#L25 assume true; 38706#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38705#L25 assume true; 38704#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38703#L25 assume true; 38702#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38701#L25 assume true; 38700#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38699#L25 assume true; 38698#L25-2 assume !(main_~d~0#1 < 6); 38697#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38695#L24 assume true; 38694#L24-2 assume !(main_~c~0#1 < 6); 38693#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 38692#L23 assume true; 38691#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 38690#L24 assume true; 38689#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38688#L25 assume true; 38687#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38686#L25 assume true; 38685#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38684#L25 assume true; 38683#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38682#L25 assume true; 38681#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38680#L25 assume true; 38679#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38678#L25 assume true; 38677#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38676#L25 assume true; 38675#L25-2 assume !(main_~d~0#1 < 6); 38674#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38673#L24 assume true; 38672#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38671#L25 assume true; 38670#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38669#L25 assume true; 38668#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38667#L25 assume true; 38666#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38665#L25 assume true; 38664#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38663#L25 assume true; 38662#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38661#L25 assume true; 38660#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38659#L25 assume true; 38658#L25-2 assume !(main_~d~0#1 < 6); 38657#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38656#L24 assume true; 38655#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38654#L25 assume true; 38653#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38652#L25 assume true; 38651#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38650#L25 assume true; 38649#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38648#L25 assume true; 38647#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38646#L25 assume true; 38645#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38644#L25 assume true; 38643#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38642#L25 assume true; 38641#L25-2 assume !(main_~d~0#1 < 6); 38640#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38639#L24 assume true; 38638#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38637#L25 assume true; 38636#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38635#L25 assume true; 38634#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38633#L25 assume true; 38632#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38631#L25 assume true; 38630#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38629#L25 assume true; 38628#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38627#L25 assume true; 38626#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38625#L25 assume true; 38624#L25-2 assume !(main_~d~0#1 < 6); 38623#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38622#L24 assume true; 38621#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38620#L25 assume true; 38619#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38618#L25 assume true; 38617#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38616#L25 assume true; 38615#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38614#L25 assume true; 38613#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38612#L25 assume true; 38611#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38610#L25 assume true; 38609#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38608#L25 assume true; 38607#L25-2 assume !(main_~d~0#1 < 6); 38606#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38605#L24 assume true; 38572#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38603#L25 assume true; 38601#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38599#L25 assume true; 38597#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38595#L25 assume true; 38593#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38591#L25 assume true; 38589#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38587#L25 assume true; 38585#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38583#L25 assume true; 38580#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38579#L25 assume true; 38577#L25-2 assume !(main_~d~0#1 < 6); 38575#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38571#L24 assume true; 38569#L24-2 assume !(main_~c~0#1 < 6); 38567#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 38565#L23 assume true; 38564#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 38560#L24 assume true; 38561#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38556#L25 assume true; 38557#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38552#L25 assume true; 38553#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38548#L25 assume true; 38549#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38544#L25 assume true; 38545#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38540#L25 assume true; 38541#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38537#L25 assume true; 38533#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38532#L25 assume true; 38534#L25-2 assume !(main_~d~0#1 < 6); 38528#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38529#L24 assume true; 38524#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38525#L25 assume true; 38520#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38521#L25 assume true; 38516#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38517#L25 assume true; 38512#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38513#L25 assume true; 38508#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38509#L25 assume true; 38504#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38505#L25 assume true; 38501#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38502#L25 assume true; 38496#L25-2 assume !(main_~d~0#1 < 6); 38497#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38492#L24 assume true; 38493#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38488#L25 assume true; 38489#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38484#L25 assume true; 38485#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38480#L25 assume true; 38481#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38476#L25 assume true; 38477#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38472#L25 assume true; 38473#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38469#L25 assume true; 38466#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38464#L25 assume true; 38465#L25-2 assume !(main_~d~0#1 < 6); 38460#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38461#L24 assume true; 38456#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38457#L25 assume true; 38452#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38453#L25 assume true; 38448#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38449#L25 assume true; 38444#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38445#L25 assume true; 38440#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38441#L25 assume true; 38436#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38437#L25 assume true; 38433#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38434#L25 assume true; 38428#L25-2 assume !(main_~d~0#1 < 6); 38429#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38424#L24 assume true; 38425#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38420#L25 assume true; 38421#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38416#L25 assume true; 38417#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38412#L25 assume true; 38413#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38408#L25 assume true; 38409#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38404#L25 assume true; 38405#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38401#L25 assume true; 38397#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38396#L25 assume true; 38398#L25-2 assume !(main_~d~0#1 < 6); 38392#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38393#L24 assume true; 38358#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38389#L25 assume true; 38385#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38386#L25 assume true; 38381#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38382#L25 assume true; 38377#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38378#L25 assume true; 38373#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38374#L25 assume true; 38369#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38370#L25 assume true; 38366#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38367#L25 assume true; 38361#L25-2 assume !(main_~d~0#1 < 6); 38362#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38356#L24 assume true; 38357#L24-2 assume !(main_~c~0#1 < 6); 38352#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 38353#L23 assume true; 38248#L23-2 assume !(main_~b~0#1 < 6); 38223#L22-1 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 38224#L22 assume true; 38233#L22-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 38234#L23 [2024-11-10 23:06:19,115 INFO L747 eck$LassoCheckResult]: Loop: 38234#L23 assume true; 38242#L23-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 38243#L24 assume true; 38246#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38351#L25 assume true; 38350#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38349#L25 assume true; 38348#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38347#L25 assume true; 38346#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38345#L25 assume true; 38344#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38343#L25 assume true; 38342#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38341#L25 assume true; 38340#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38339#L25 assume true; 38338#L25-2 assume !(main_~d~0#1 < 6); 38337#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38336#L24 assume true; 38335#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38334#L25 assume true; 38333#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38332#L25 assume true; 38331#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38330#L25 assume true; 38329#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38328#L25 assume true; 38327#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38326#L25 assume true; 38325#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38324#L25 assume true; 38323#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38322#L25 assume true; 38321#L25-2 assume !(main_~d~0#1 < 6); 38320#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38319#L24 assume true; 38318#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38317#L25 assume true; 38316#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38315#L25 assume true; 38314#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38313#L25 assume true; 38312#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38311#L25 assume true; 38310#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38309#L25 assume true; 38308#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38307#L25 assume true; 38306#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38305#L25 assume true; 38304#L25-2 assume !(main_~d~0#1 < 6); 38303#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38302#L24 assume true; 38301#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38300#L25 assume true; 38299#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38298#L25 assume true; 38297#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38296#L25 assume true; 38295#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38294#L25 assume true; 38293#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38292#L25 assume true; 38291#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38290#L25 assume true; 38289#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38288#L25 assume true; 38287#L25-2 assume !(main_~d~0#1 < 6); 38286#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38285#L24 assume true; 38284#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38283#L25 assume true; 38282#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38281#L25 assume true; 38280#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38279#L25 assume true; 38278#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38277#L25 assume true; 38276#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38275#L25 assume true; 38274#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38273#L25 assume true; 38272#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38271#L25 assume true; 38270#L25-2 assume !(main_~d~0#1 < 6); 38269#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38268#L24 assume true; 38250#L24-2 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 38265#L25 assume true; 38264#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38263#L25 assume true; 38262#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38261#L25 assume true; 38260#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38259#L25 assume true; 38258#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38257#L25 assume true; 38256#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38255#L25 assume true; 38254#L25-2 assume !!(main_~d~0#1 < 6);main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 38253#L25 assume true; 38252#L25-2 assume !(main_~d~0#1 < 6); 38251#L24-1 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 38249#L24 assume true; 38225#L24-2 assume !(main_~c~0#1 < 6); 38226#L23-1 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 38234#L23 [2024-11-10 23:06:19,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1986658313, now seen corresponding path program 2 times [2024-11-10 23:06:19,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:19,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880136594] [2024-11-10 23:06:19,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:19,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:19,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:19,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:19,241 INFO L85 PathProgramCache]: Analyzing trace with hash -700005462, now seen corresponding path program 2 times [2024-11-10 23:06:19,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:19,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171242706] [2024-11-10 23:06:19,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:19,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:19,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:19,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:19,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1154724190, now seen corresponding path program 3 times [2024-11-10 23:06:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14701424] [2024-11-10 23:06:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:19,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:19,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:19,938 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:19,938 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:19,938 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:19,938 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:19,938 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:06:19,938 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:19,938 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:19,938 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:19,938 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration16_Loop [2024-11-10 23:06:19,938 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:19,938 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:19,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:19,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:19,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:19,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:19,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:19,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:19,971 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:19,971 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:06:19,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:19,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:19,973 INFO L229 MonitoredProcess]: Starting monitored process 60 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-10 23:06:19,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-10 23:06:19,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:19,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:19,985 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:19,985 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:19,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-10 23:06:19,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:19,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:19,995 INFO L229 MonitoredProcess]: Starting monitored process 61 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-10 23:06:19,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-10 23:06:19,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:19,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:20,007 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:20,008 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=6} Honda state: {ULTIMATE.start_main_~c~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:20,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-10 23:06:20,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:20,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:20,019 INFO L229 MonitoredProcess]: Starting monitored process 62 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-10 23:06:20,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-10 23:06:20,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:20,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:20,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:20,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:20,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:20,041 INFO L229 MonitoredProcess]: Starting monitored process 63 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-10 23:06:20,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-10 23:06:20,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:06:20,043 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:20,068 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:06:20,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-10 23:06:20,073 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:20,073 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:20,073 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:20,073 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:20,073 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:06:20,073 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:20,073 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:20,073 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:20,073 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration16_Loop [2024-11-10 23:06:20,073 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:20,073 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:20,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:20,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:20,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:20,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:20,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:20,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:20,110 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:20,110 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:06:20,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:20,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:20,112 INFO L229 MonitoredProcess]: Starting monitored process 64 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-10 23:06:20,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-10 23:06:20,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:20,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:20,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:20,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:20,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:20,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:20,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:20,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:20,125 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:20,126 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:20,126 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:20,127 INFO L229 MonitoredProcess]: Starting monitored process 65 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-10 23:06:20,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-10 23:06:20,128 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:20,128 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:20,128 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:20,129 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:20,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-10 23:06:20,138 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:20,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:20,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:20,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:20,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:20,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2024-11-10 23:06:21,069 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:06:21,069 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1403 states and 1497 transitions. cyclomatic complexity: 127 Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-10 23:06:21,086 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1403 states and 1497 transitions. cyclomatic complexity: 127. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) Result 2048 states and 2186 transitions. Complement of second has 7 states. [2024-11-10 23:06:21,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-10 23:06:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-10 23:06:21,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 651 letters. Loop has 107 letters. [2024-11-10 23:06:21,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:21,088 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:06:21,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:21,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:21,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:21,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:21,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:21,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2024-11-10 23:06:21,987 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:06:21,987 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1403 states and 1497 transitions. cyclomatic complexity: 127 Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-10 23:06:22,002 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1403 states and 1497 transitions. cyclomatic complexity: 127. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) Result 2048 states and 2186 transitions. Complement of second has 7 states. [2024-11-10 23:06:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-10 23:06:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-10 23:06:22,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 651 letters. Loop has 107 letters. [2024-11-10 23:06:22,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:22,005 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:06:22,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:22,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:22,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:22,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:22,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2024-11-10 23:06:22,874 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 23:06:22,875 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1403 states and 1497 transitions. cyclomatic complexity: 127 Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-10 23:06:22,890 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1403 states and 1497 transitions. cyclomatic complexity: 127. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) Result 2788 states and 2977 transitions. Complement of second has 6 states. [2024-11-10 23:06:22,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-10 23:06:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2024-11-10 23:06:22,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 651 letters. Loop has 107 letters. [2024-11-10 23:06:22,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:22,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 758 letters. Loop has 107 letters. [2024-11-10 23:06:22,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:22,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 651 letters. Loop has 214 letters. [2024-11-10 23:06:22,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:22,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2788 states and 2977 transitions. [2024-11-10 23:06:22,900 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 23:06:22,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2788 states to 0 states and 0 transitions. [2024-11-10 23:06:22,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-10 23:06:22,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-10 23:06:22,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-10 23:06:22,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:06:22,901 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:06:22,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:06:22,901 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:06:22,901 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-10 23:06:22,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-10 23:06:22,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 23:06:22,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-10 23:06:22,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:06:22 BoogieIcfgContainer [2024-11-10 23:06:22,906 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 23:06:22,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 23:06:22,907 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 23:06:22,907 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 23:06:22,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:56" (3/4) ... [2024-11-10 23:06:22,908 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 23:06:22,909 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 23:06:22,910 INFO L158 Benchmark]: Toolchain (without parser) took 26865.20ms. Allocated memory was 148.9MB in the beginning and 408.9MB in the end (delta: 260.0MB). Free memory was 77.2MB in the beginning and 129.3MB in the end (delta: -52.1MB). Peak memory consumption was 208.3MB. Max. memory is 16.1GB. [2024-11-10 23:06:22,910 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:06:22,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.90ms. Allocated memory is still 148.9MB. Free memory was 77.0MB in the beginning and 117.9MB in the end (delta: -40.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-10 23:06:22,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.44ms. Allocated memory was 148.9MB in the beginning and 195.0MB in the end (delta: 46.1MB). Free memory was 117.8MB in the beginning and 166.9MB in the end (delta: -49.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:06:22,910 INFO L158 Benchmark]: Boogie Preprocessor took 26.77ms. Allocated memory is still 195.0MB. Free memory was 166.9MB in the beginning and 165.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:06:22,910 INFO L158 Benchmark]: IcfgBuilder took 208.70ms. Allocated memory is still 195.0MB. Free memory was 165.8MB in the beginning and 153.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 23:06:22,911 INFO L158 Benchmark]: BuchiAutomizer took 26404.74ms. Allocated memory was 195.0MB in the beginning and 408.9MB in the end (delta: 213.9MB). Free memory was 153.3MB in the beginning and 129.3MB in the end (delta: 24.0MB). Peak memory consumption was 236.9MB. Max. memory is 16.1GB. [2024-11-10 23:06:22,911 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 408.9MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:06:22,912 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 148.9MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.90ms. Allocated memory is still 148.9MB. Free memory was 77.0MB in the beginning and 117.9MB in the end (delta: -40.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.44ms. Allocated memory was 148.9MB in the beginning and 195.0MB in the end (delta: 46.1MB). Free memory was 117.8MB in the beginning and 166.9MB in the end (delta: -49.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.77ms. Allocated memory is still 195.0MB. Free memory was 166.9MB in the beginning and 165.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 208.70ms. Allocated memory is still 195.0MB. Free memory was 165.8MB in the beginning and 153.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 26404.74ms. Allocated memory was 195.0MB in the beginning and 408.9MB in the end (delta: 213.9MB). Free memory was 153.3MB in the beginning and 129.3MB in the end (delta: 24.0MB). Peak memory consumption was 236.9MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 408.9MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (9 trivial, 4 deterministic, 3 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * a) + 11) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * d) + 11) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * d) + 11) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.3s and 17 iterations. TraceHistogramMax:252. Analysis of lassos took 19.6s. Construction of modules took 0.2s. Büchi inclusion checks took 6.2s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 6. Automata minimization 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 779 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 69303/69303 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 403 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 390 mSDsluCounter, 685 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 335 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 350 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT7 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp75 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-10 23:06:22,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:23,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:23,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 23:06:23,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:23,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:23,936 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 Result: TRUE