./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 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml', '-i', '../sv-benchmarks/c/loop-simple/nested_4.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-simple/nested_4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-4f9af40 [2024-11-08 00:19:19,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 00:19:19,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-08 00:19:19,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 00:19:19,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 00:19:19,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 00:19:19,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 00:19:19,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 00:19:19,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 00:19:19,907 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 00:19:19,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 00:19:19,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 00:19:19,908 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 00:19:19,908 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-08 00:19:19,909 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-08 00:19:19,909 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-08 00:19:19,909 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-08 00:19:19,909 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-08 00:19:19,909 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-08 00:19:19,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 00:19:19,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-08 00:19:19,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 00:19:19,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 00:19:19,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 00:19:19,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 00:19:19,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-08 00:19:19,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-08 00:19:19,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-08 00:19:19,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 00:19:19,911 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 00:19:19,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 00:19:19,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 00:19:19,911 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-08 00:19:19,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 00:19:19,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 00:19:19,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 00:19:19,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 00:19:19,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 00:19:19,913 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-08 00:19:19,913 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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-08 00:19:20,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 00:19:20,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 00:19:20,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 00:19:20,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 00:19:20,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 00:19:20,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_4.c [2024-11-08 00:19:21,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 00:19:21,796 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 00:19:21,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_4.c [2024-11-08 00:19:21,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc2350acd/e2702e1d36ad415792a20cd351126ed2/FLAGf5b3c961d [2024-11-08 00:19:21,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc2350acd/e2702e1d36ad415792a20cd351126ed2 [2024-11-08 00:19:21,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 00:19:21,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 00:19:21,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 00:19:21,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 00:19:21,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 00:19:21,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:19:21" (1/1) ... [2024-11-08 00:19:21,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7046786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21, skipping insertion in model container [2024-11-08 00:19:21,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:19:21" (1/1) ... [2024-11-08 00:19:21,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 00:19:21,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 00:19:22,003 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 00:19:22,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 00:19:22,030 INFO L204 MainTranslator]: Completed translation [2024-11-08 00:19:22,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22 WrapperNode [2024-11-08 00:19:22,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 00:19:22,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 00:19:22,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 00:19:22,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 00:19:22,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,060 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2024-11-08 00:19:22,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 00:19:22,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 00:19:22,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 00:19:22,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 00:19:22,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,087 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-08 00:19:22,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 00:19:22,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 00:19:22,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 00:19:22,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 00:19:22,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (1/1) ... [2024-11-08 00:19:22,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:22,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:22,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:22,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-08 00:19:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 00:19:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 00:19:22,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 00:19:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 00:19:22,237 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 00:19:22,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 00:19:22,337 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-08 00:19:22,337 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 00:19:22,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 00:19:22,346 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-08 00:19:22,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:19:22 BoogieIcfgContainer [2024-11-08 00:19:22,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 00:19:22,348 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-08 00:19:22,349 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-08 00:19:22,353 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-08 00:19:22,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:19:22,354 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 12:19:21" (1/3) ... [2024-11-08 00:19:22,355 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2dfbcd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:19:22, skipping insertion in model container [2024-11-08 00:19:22,355 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:19:22,356 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:22" (2/3) ... [2024-11-08 00:19:22,356 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2dfbcd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:19:22, skipping insertion in model container [2024-11-08 00:19:22,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:19:22,356 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:19:22" (3/3) ... [2024-11-08 00:19:22,358 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_4.c [2024-11-08 00:19:22,406 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-08 00:19:22,406 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-08 00:19:22,406 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-08 00:19:22,407 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-08 00:19:22,407 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-08 00:19:22,407 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-08 00:19:22,407 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-08 00:19:22,407 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-08 00:19:22,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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-08 00:19:22,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-08 00:19:22,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:22,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:22,431 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:19:22,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-08 00:19:22,431 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-08 00:19:22,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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-08 00:19:22,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-08 00:19:22,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:22,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:22,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:19:22,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-08 00:19:22,441 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 6#L-1true 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; 13#L22-3true [2024-11-08 00:19:22,441 INFO L747 eck$LassoCheckResult]: Loop: 13#L22-3true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 14#L23-3true assume !(main_~b~0#1 < 6); 7#L22-2true main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 13#L22-3true [2024-11-08 00:19:22,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-08 00:19:22,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:22,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461797117] [2024-11-08 00:19:22,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:22,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:22,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:22,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:22,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:22,565 INFO L85 PathProgramCache]: Analyzing trace with hash 39945, now seen corresponding path program 1 times [2024-11-08 00:19:22,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:22,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503189604] [2024-11-08 00:19:22,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:22,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:22,642 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-08 00:19:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:19:22,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503189604] [2024-11-08 00:19:22,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503189604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:19:22,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:19:22,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 00:19:22,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969018280] [2024-11-08 00:19:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:19:22,648 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:19:22,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:19:22,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 00:19:22,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 00:19:22,677 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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-08 00:19:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:19:22,705 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-08 00:19:22,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2024-11-08 00:19:22,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-08 00:19:22,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 21 transitions. [2024-11-08 00:19:22,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-08 00:19:22,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-08 00:19:22,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2024-11-08 00:19:22,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:19:22,719 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-08 00:19:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2024-11-08 00:19:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2024-11-08 00:19:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 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-08 00:19:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-11-08 00:19:22,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-08 00:19:22,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 00:19:22,750 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-08 00:19:22,751 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-08 00:19:22,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-11-08 00:19:22,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-08 00:19:22,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:22,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:22,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:19:22,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-08 00:19:22,754 INFO L745 eck$LassoCheckResult]: Stem: 52#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 53#L-1 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; 55#L22-3 [2024-11-08 00:19:22,754 INFO L747 eck$LassoCheckResult]: Loop: 55#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 54#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 49#L24-3 assume !(main_~c~0#1 < 6); 50#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 51#L23-3 assume !(main_~b~0#1 < 6); 56#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 55#L22-3 [2024-11-08 00:19:22,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-08 00:19:22,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073620091] [2024-11-08 00:19:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:22,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:22,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:22,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:22,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1191176381, now seen corresponding path program 1 times [2024-11-08 00:19:22,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:22,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465536659] [2024-11-08 00:19:22,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:22,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:19:22,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:19:22,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465536659] [2024-11-08 00:19:22,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465536659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:19:22,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:19:22,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 00:19:22,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730531442] [2024-11-08 00:19:22,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:19:22,823 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:19:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:19:22,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 00:19:22,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 00:19:22,824 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-08 00:19:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:19:22,839 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-11-08 00:19:22,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2024-11-08 00:19:22,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-08 00:19:22,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2024-11-08 00:19:22,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-08 00:19:22,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-08 00:19:22,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-11-08 00:19:22,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:19:22,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-08 00:19:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-11-08 00:19:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2024-11-08 00:19:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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-08 00:19:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-11-08 00:19:22,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-08 00:19:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 00:19:22,846 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-08 00:19:22,846 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-08 00:19:22,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2024-11-08 00:19:22,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-08 00:19:22,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:22,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:22,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:19:22,849 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:19:22,849 INFO L745 eck$LassoCheckResult]: Stem: 84#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 85#L-1 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; 86#L22-3 [2024-11-08 00:19:22,849 INFO L747 eck$LassoCheckResult]: Loop: 86#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 87#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 88#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 79#L25-3 assume !(main_~d~0#1 < 6); 80#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 81#L24-3 assume !(main_~c~0#1 < 6); 82#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 83#L23-3 assume !(main_~b~0#1 < 6); 89#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 86#L22-3 [2024-11-08 00:19:22,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:22,850 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-08 00:19:22,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:22,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464685496] [2024-11-08 00:19:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:22,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:22,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:22,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:22,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:22,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1526250579, now seen corresponding path program 1 times [2024-11-08 00:19:22,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:22,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429018670] [2024-11-08 00:19:22,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:22,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:22,924 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-08 00:19:22,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:19:22,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429018670] [2024-11-08 00:19:22,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429018670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:19:22,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:19:22,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 00:19:22,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662957188] [2024-11-08 00:19:22,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:19:22,925 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:19:22,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:19:22,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 00:19:22,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 00:19:22,926 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-08 00:19:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:19:22,937 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2024-11-08 00:19:22,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2024-11-08 00:19:22,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-08 00:19:22,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2024-11-08 00:19:22,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-08 00:19:22,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-08 00:19:22,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2024-11-08 00:19:22,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:19:22,939 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-11-08 00:19:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2024-11-08 00:19:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-08 00:19:22,940 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-08 00:19:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-11-08 00:19:22,942 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-08 00:19:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 00:19:22,944 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-08 00:19:22,944 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-08 00:19:22,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-11-08 00:19:22,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-08 00:19:22,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:22,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:22,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:19:22,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:19:22,945 INFO L745 eck$LassoCheckResult]: Stem: 117#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 118#L-1 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; 119#L22-3 [2024-11-08 00:19:22,945 INFO L747 eck$LassoCheckResult]: Loop: 119#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 120#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 121#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 116#L25-3 assume !!(main_~d~0#1 < 6); 110#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 111#L25-3 assume !(main_~d~0#1 < 6); 112#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 113#L24-3 assume !(main_~c~0#1 < 6); 114#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 115#L23-3 assume !(main_~b~0#1 < 6); 122#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 119#L22-3 [2024-11-08 00:19:22,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-08 00:19:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:22,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836813008] [2024-11-08 00:19:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:22,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:22,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:22,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:22,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1981778385, now seen corresponding path program 1 times [2024-11-08 00:19:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:22,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707844368] [2024-11-08 00:19:22,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:22,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:19:23,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:19:23,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707844368] [2024-11-08 00:19:23,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707844368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:19:23,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888089029] [2024-11-08 00:19:23,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:23,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:19:23,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:23,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:19:23,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 00:19:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:23,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 00:19:23,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:19:23,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:19:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:19:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888089029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:19:23,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:19:23,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-08 00:19:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426330109] [2024-11-08 00:19:23,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:19:23,143 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:19:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:19:23,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 00:19:23,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 00:19:23,143 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-08 00:19:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:19:23,171 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-08 00:19:23,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2024-11-08 00:19:23,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-08 00:19:23,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 22 transitions. [2024-11-08 00:19:23,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-08 00:19:23,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-08 00:19:23,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-11-08 00:19:23,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:19:23,173 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-08 00:19:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-11-08 00:19:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-08 00:19:23,176 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-08 00:19:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-08 00:19:23,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-08 00:19:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 00:19:23,178 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-08 00:19:23,178 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-08 00:19:23,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2024-11-08 00:19:23,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-08 00:19:23,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:23,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:23,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:19:23,179 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:19:23,179 INFO L745 eck$LassoCheckResult]: Stem: 218#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 219#L-1 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; 220#L22-3 [2024-11-08 00:19:23,179 INFO L747 eck$LassoCheckResult]: Loop: 220#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 221#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 222#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 217#L25-3 assume !!(main_~d~0#1 < 6); 211#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 212#L25-3 assume !!(main_~d~0#1 < 6); 229#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 228#L25-3 assume !!(main_~d~0#1 < 6); 227#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 226#L25-3 assume !!(main_~d~0#1 < 6); 225#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 224#L25-3 assume !(main_~d~0#1 < 6); 213#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 214#L24-3 assume !(main_~c~0#1 < 6); 215#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 216#L23-3 assume !(main_~b~0#1 < 6); 223#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 220#L22-3 [2024-11-08 00:19:23,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:23,179 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-08 00:19:23,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:23,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149672760] [2024-11-08 00:19:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:23,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:23,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:23,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:23,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:23,207 INFO L85 PathProgramCache]: Analyzing trace with hash 669317813, now seen corresponding path program 2 times [2024-11-08 00:19:23,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:23,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217896188] [2024-11-08 00:19:23,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:23,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 00:19:23,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:19:23,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217896188] [2024-11-08 00:19:23,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217896188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:19:23,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268783307] [2024-11-08 00:19:23,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 00:19:23,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:19:23,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:23,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:19:23,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 00:19:23,339 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 00:19:23,339 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:19:23,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 00:19:23,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:19:23,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:19:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:19:23,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268783307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:19:23,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:19:23,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-11-08 00:19:23,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443063455] [2024-11-08 00:19:23,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:19:23,506 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:19:23,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:19:23,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 00:19:23,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 00:19:23,507 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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-08 00:19:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:19:23,708 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-11-08 00:19:23,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 57 transitions. [2024-11-08 00:19:23,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2024-11-08 00:19:23,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 57 transitions. [2024-11-08 00:19:23,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-11-08 00:19:23,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2024-11-08 00:19:23,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 57 transitions. [2024-11-08 00:19:23,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:19:23,711 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-08 00:19:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 57 transitions. [2024-11-08 00:19:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2024-11-08 00:19:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 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-08 00:19:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-08 00:19:23,716 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-08 00:19:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 00:19:23,717 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-08 00:19:23,717 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-08 00:19:23,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2024-11-08 00:19:23,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2024-11-08 00:19:23,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:23,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:23,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:19:23,718 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 00:19:23,718 INFO L745 eck$LassoCheckResult]: Stem: 422#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 423#L-1 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; 426#L22-3 [2024-11-08 00:19:23,719 INFO L747 eck$LassoCheckResult]: Loop: 426#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 424#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 425#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 443#L25-3 assume !!(main_~d~0#1 < 6); 442#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 441#L25-3 assume !!(main_~d~0#1 < 6); 440#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 439#L25-3 assume !!(main_~d~0#1 < 6); 438#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 437#L25-3 assume !!(main_~d~0#1 < 6); 436#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 435#L25-3 assume !!(main_~d~0#1 < 6); 434#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 433#L25-3 assume !!(main_~d~0#1 < 6); 432#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 431#L25-3 assume !(main_~d~0#1 < 6); 417#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 418#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 427#L25-3 assume !!(main_~d~0#1 < 6); 415#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 416#L25-3 assume !!(main_~d~0#1 < 6); 421#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 452#L25-3 assume !!(main_~d~0#1 < 6); 451#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 450#L25-3 assume !!(main_~d~0#1 < 6); 449#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 448#L25-3 assume !!(main_~d~0#1 < 6); 447#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 446#L25-3 assume !!(main_~d~0#1 < 6); 445#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 444#L25-3 assume !(main_~d~0#1 < 6); 430#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 429#L24-3 assume !(main_~c~0#1 < 6); 419#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 420#L23-3 assume !(main_~b~0#1 < 6); 428#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 426#L22-3 [2024-11-08 00:19:23,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-08 00:19:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:23,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811928589] [2024-11-08 00:19:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:23,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:23,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:23,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:23,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:23,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1141890755, now seen corresponding path program 3 times [2024-11-08 00:19:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:23,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299213737] [2024-11-08 00:19:23,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:23,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-08 00:19:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:19:23,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299213737] [2024-11-08 00:19:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299213737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:19:23,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099664589] [2024-11-08 00:19:23,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 00:19:23,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:19:23,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:23,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:19:23,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 00:19:23,853 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 00:19:23,853 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:19:23,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 00:19:23,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-08 00:19:23,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:19:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-08 00:19:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099664589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:19:24,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:19:24,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-08 00:19:24,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675478871] [2024-11-08 00:19:24,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:19:24,039 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:19:24,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:19:24,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 00:19:24,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 00:19:24,040 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-08 00:19:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:19:24,070 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2024-11-08 00:19:24,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 150 transitions. [2024-11-08 00:19:24,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2024-11-08 00:19:24,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 150 transitions. [2024-11-08 00:19:24,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2024-11-08 00:19:24,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2024-11-08 00:19:24,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 150 transitions. [2024-11-08 00:19:24,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:19:24,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 150 transitions. [2024-11-08 00:19:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 150 transitions. [2024-11-08 00:19:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-08 00:19:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.094890510948905) internal successors, (150), 136 states have internal predecessors, (150), 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-08 00:19:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2024-11-08 00:19:24,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 150 transitions. [2024-11-08 00:19:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 00:19:24,084 INFO L425 stractBuchiCegarLoop]: Abstraction has 137 states and 150 transitions. [2024-11-08 00:19:24,084 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-08 00:19:24,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 150 transitions. [2024-11-08 00:19:24,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2024-11-08 00:19:24,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:24,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:24,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:19:24,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 8, 8, 8, 4, 4, 4, 1, 1, 1] [2024-11-08 00:19:24,091 INFO L745 eck$LassoCheckResult]: Stem: 816#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 817#L-1 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; 820#L22-3 [2024-11-08 00:19:24,092 INFO L747 eck$LassoCheckResult]: Loop: 820#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 818#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 819#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 815#L25-3 assume !!(main_~d~0#1 < 6); 809#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 810#L25-3 assume !!(main_~d~0#1 < 6); 941#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 939#L25-3 assume !!(main_~d~0#1 < 6); 937#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 935#L25-3 assume !!(main_~d~0#1 < 6); 933#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 931#L25-3 assume !!(main_~d~0#1 < 6); 929#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 927#L25-3 assume !!(main_~d~0#1 < 6); 925#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 924#L25-3 assume !(main_~d~0#1 < 6); 811#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 812#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 893#L25-3 assume !!(main_~d~0#1 < 6); 919#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 917#L25-3 assume !!(main_~d~0#1 < 6); 915#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 913#L25-3 assume !!(main_~d~0#1 < 6); 911#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 909#L25-3 assume !!(main_~d~0#1 < 6); 907#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 905#L25-3 assume !!(main_~d~0#1 < 6); 903#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 901#L25-3 assume !!(main_~d~0#1 < 6); 899#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 898#L25-3 assume !(main_~d~0#1 < 6); 895#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 892#L24-3 assume !(main_~c~0#1 < 6); 813#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 814#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 945#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 944#L25-3 assume !!(main_~d~0#1 < 6); 943#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 942#L25-3 assume !!(main_~d~0#1 < 6); 940#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 938#L25-3 assume !!(main_~d~0#1 < 6); 936#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 934#L25-3 assume !!(main_~d~0#1 < 6); 932#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 930#L25-3 assume !!(main_~d~0#1 < 6); 928#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 926#L25-3 assume !!(main_~d~0#1 < 6); 923#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 922#L25-3 assume !(main_~d~0#1 < 6); 921#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 920#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 891#L25-3 assume !!(main_~d~0#1 < 6); 918#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 916#L25-3 assume !!(main_~d~0#1 < 6); 914#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 912#L25-3 assume !!(main_~d~0#1 < 6); 910#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 908#L25-3 assume !!(main_~d~0#1 < 6); 906#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 904#L25-3 assume !!(main_~d~0#1 < 6); 902#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 900#L25-3 assume !!(main_~d~0#1 < 6); 897#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 896#L25-3 assume !(main_~d~0#1 < 6); 894#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 890#L24-3 assume !(main_~c~0#1 < 6); 889#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 888#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 887#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 886#L25-3 assume !!(main_~d~0#1 < 6); 885#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 884#L25-3 assume !!(main_~d~0#1 < 6); 883#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 882#L25-3 assume !!(main_~d~0#1 < 6); 881#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 880#L25-3 assume !!(main_~d~0#1 < 6); 879#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 878#L25-3 assume !!(main_~d~0#1 < 6); 877#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 876#L25-3 assume !!(main_~d~0#1 < 6); 875#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 874#L25-3 assume !(main_~d~0#1 < 6); 873#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 872#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 858#L25-3 assume !!(main_~d~0#1 < 6); 871#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 870#L25-3 assume !!(main_~d~0#1 < 6); 869#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 868#L25-3 assume !!(main_~d~0#1 < 6); 867#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 866#L25-3 assume !!(main_~d~0#1 < 6); 865#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 864#L25-3 assume !!(main_~d~0#1 < 6); 863#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 862#L25-3 assume !!(main_~d~0#1 < 6); 861#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 860#L25-3 assume !(main_~d~0#1 < 6); 859#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 857#L24-3 assume !(main_~c~0#1 < 6); 856#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 855#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 823#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 854#L25-3 assume !!(main_~d~0#1 < 6); 853#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 852#L25-3 assume !!(main_~d~0#1 < 6); 851#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 850#L25-3 assume !!(main_~d~0#1 < 6); 849#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 848#L25-3 assume !!(main_~d~0#1 < 6); 847#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 846#L25-3 assume !!(main_~d~0#1 < 6); 845#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 844#L25-3 assume !!(main_~d~0#1 < 6); 843#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 842#L25-3 assume !(main_~d~0#1 < 6); 841#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 840#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 826#L25-3 assume !!(main_~d~0#1 < 6); 839#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 838#L25-3 assume !!(main_~d~0#1 < 6); 837#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 836#L25-3 assume !!(main_~d~0#1 < 6); 835#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 834#L25-3 assume !!(main_~d~0#1 < 6); 833#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 832#L25-3 assume !!(main_~d~0#1 < 6); 831#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 830#L25-3 assume !!(main_~d~0#1 < 6); 829#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 828#L25-3 assume !(main_~d~0#1 < 6); 827#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 825#L24-3 assume !(main_~c~0#1 < 6); 824#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 822#L23-3 assume !(main_~b~0#1 < 6); 821#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 820#L22-3 [2024-11-08 00:19:24,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:24,092 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-08 00:19:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:24,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738354655] [2024-11-08 00:19:24,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:24,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:24,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:24,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1405490935, now seen corresponding path program 4 times [2024-11-08 00:19:24,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:24,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585230675] [2024-11-08 00:19:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2778 backedges. 1063 proven. 89 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-11-08 00:19:24,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:19:24,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585230675] [2024-11-08 00:19:24,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585230675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:19:24,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926708981] [2024-11-08 00:19:24,332 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 00:19:24,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:19:24,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:24,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:19:24,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 00:19:24,435 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 00:19:24,435 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:19:24,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:24,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2778 backedges. 1063 proven. 89 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-11-08 00:19:24,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:19:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2778 backedges. 1063 proven. 89 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-11-08 00:19:24,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926708981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:19:24,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:19:24,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-08 00:19:24,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284204190] [2024-11-08 00:19:24,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:19:24,597 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:19:24,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:19:24,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 00:19:24,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-08 00:19:24,603 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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-08 00:19:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:19:24,641 INFO L93 Difference]: Finished difference Result 377 states and 406 transitions. [2024-11-08 00:19:24,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 377 states and 406 transitions. [2024-11-08 00:19:24,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 375 [2024-11-08 00:19:24,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 377 states to 377 states and 406 transitions. [2024-11-08 00:19:24,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 377 [2024-11-08 00:19:24,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 377 [2024-11-08 00:19:24,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 406 transitions. [2024-11-08 00:19:24,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:19:24,654 INFO L218 hiAutomatonCegarLoop]: Abstraction has 377 states and 406 transitions. [2024-11-08 00:19:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 406 transitions. [2024-11-08 00:19:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-08 00:19:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 377 states have (on average 1.0769230769230769) internal successors, (406), 376 states have internal predecessors, (406), 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-08 00:19:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 406 transitions. [2024-11-08 00:19:24,680 INFO L240 hiAutomatonCegarLoop]: Abstraction has 377 states and 406 transitions. [2024-11-08 00:19:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 00:19:24,684 INFO L425 stractBuchiCegarLoop]: Abstraction has 377 states and 406 transitions. [2024-11-08 00:19:24,684 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-08 00:19:24,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 377 states and 406 transitions. [2024-11-08 00:19:24,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 375 [2024-11-08 00:19:24,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:24,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:24,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:19:24,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [144, 144, 24, 24, 24, 4, 4, 4, 1, 1, 1] [2024-11-08 00:19:24,694 INFO L745 eck$LassoCheckResult]: Stem: 2145#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2146#L-1 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; 2149#L22-3 [2024-11-08 00:19:24,694 INFO L747 eck$LassoCheckResult]: Loop: 2149#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2147#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2148#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2144#L25-3 assume !!(main_~d~0#1 < 6); 2138#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2139#L25-3 assume !!(main_~d~0#1 < 6); 2510#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2508#L25-3 assume !!(main_~d~0#1 < 6); 2506#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2504#L25-3 assume !!(main_~d~0#1 < 6); 2502#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2500#L25-3 assume !!(main_~d~0#1 < 6); 2498#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2496#L25-3 assume !!(main_~d~0#1 < 6); 2494#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2493#L25-3 assume !(main_~d~0#1 < 6); 2140#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2141#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2488#L25-3 assume !!(main_~d~0#1 < 6); 2486#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2484#L25-3 assume !!(main_~d~0#1 < 6); 2482#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2480#L25-3 assume !!(main_~d~0#1 < 6); 2478#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2476#L25-3 assume !!(main_~d~0#1 < 6); 2474#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2472#L25-3 assume !!(main_~d~0#1 < 6); 2470#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2468#L25-3 assume !!(main_~d~0#1 < 6); 2466#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2465#L25-3 assume !(main_~d~0#1 < 6); 2462#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2460#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2458#L25-3 assume !!(main_~d~0#1 < 6); 2456#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2454#L25-3 assume !!(main_~d~0#1 < 6); 2452#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2450#L25-3 assume !!(main_~d~0#1 < 6); 2448#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2446#L25-3 assume !!(main_~d~0#1 < 6); 2444#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2442#L25-3 assume !!(main_~d~0#1 < 6); 2440#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2438#L25-3 assume !!(main_~d~0#1 < 6); 2436#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2435#L25-3 assume !(main_~d~0#1 < 6); 2432#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2430#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2428#L25-3 assume !!(main_~d~0#1 < 6); 2426#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2424#L25-3 assume !!(main_~d~0#1 < 6); 2422#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2420#L25-3 assume !!(main_~d~0#1 < 6); 2418#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2416#L25-3 assume !!(main_~d~0#1 < 6); 2414#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2412#L25-3 assume !!(main_~d~0#1 < 6); 2410#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2408#L25-3 assume !!(main_~d~0#1 < 6); 2406#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2405#L25-3 assume !(main_~d~0#1 < 6); 2402#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2400#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2398#L25-3 assume !!(main_~d~0#1 < 6); 2396#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2394#L25-3 assume !!(main_~d~0#1 < 6); 2392#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2390#L25-3 assume !!(main_~d~0#1 < 6); 2388#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2386#L25-3 assume !!(main_~d~0#1 < 6); 2384#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2382#L25-3 assume !!(main_~d~0#1 < 6); 2380#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2378#L25-3 assume !!(main_~d~0#1 < 6); 2376#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2375#L25-3 assume !(main_~d~0#1 < 6); 2372#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2370#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2342#L25-3 assume !!(main_~d~0#1 < 6); 2368#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2366#L25-3 assume !!(main_~d~0#1 < 6); 2364#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2362#L25-3 assume !!(main_~d~0#1 < 6); 2360#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2358#L25-3 assume !!(main_~d~0#1 < 6); 2356#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2354#L25-3 assume !!(main_~d~0#1 < 6); 2352#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2350#L25-3 assume !!(main_~d~0#1 < 6); 2348#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2347#L25-3 assume !(main_~d~0#1 < 6); 2344#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2341#L24-3 assume !(main_~c~0#1 < 6); 2142#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2143#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2514#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2513#L25-3 assume !!(main_~d~0#1 < 6); 2512#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2511#L25-3 assume !!(main_~d~0#1 < 6); 2509#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2507#L25-3 assume !!(main_~d~0#1 < 6); 2505#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2503#L25-3 assume !!(main_~d~0#1 < 6); 2501#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2499#L25-3 assume !!(main_~d~0#1 < 6); 2497#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2495#L25-3 assume !!(main_~d~0#1 < 6); 2492#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2491#L25-3 assume !(main_~d~0#1 < 6); 2490#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2489#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2487#L25-3 assume !!(main_~d~0#1 < 6); 2485#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2483#L25-3 assume !!(main_~d~0#1 < 6); 2481#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2479#L25-3 assume !!(main_~d~0#1 < 6); 2477#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2475#L25-3 assume !!(main_~d~0#1 < 6); 2473#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2471#L25-3 assume !!(main_~d~0#1 < 6); 2469#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2467#L25-3 assume !!(main_~d~0#1 < 6); 2464#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2463#L25-3 assume !(main_~d~0#1 < 6); 2461#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2459#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2457#L25-3 assume !!(main_~d~0#1 < 6); 2455#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2453#L25-3 assume !!(main_~d~0#1 < 6); 2451#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2449#L25-3 assume !!(main_~d~0#1 < 6); 2447#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2445#L25-3 assume !!(main_~d~0#1 < 6); 2443#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2441#L25-3 assume !!(main_~d~0#1 < 6); 2439#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2437#L25-3 assume !!(main_~d~0#1 < 6); 2434#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2433#L25-3 assume !(main_~d~0#1 < 6); 2431#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2429#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2427#L25-3 assume !!(main_~d~0#1 < 6); 2425#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2423#L25-3 assume !!(main_~d~0#1 < 6); 2421#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2419#L25-3 assume !!(main_~d~0#1 < 6); 2417#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2415#L25-3 assume !!(main_~d~0#1 < 6); 2413#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2411#L25-3 assume !!(main_~d~0#1 < 6); 2409#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2407#L25-3 assume !!(main_~d~0#1 < 6); 2404#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2403#L25-3 assume !(main_~d~0#1 < 6); 2401#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2399#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2397#L25-3 assume !!(main_~d~0#1 < 6); 2395#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2393#L25-3 assume !!(main_~d~0#1 < 6); 2391#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2389#L25-3 assume !!(main_~d~0#1 < 6); 2387#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2385#L25-3 assume !!(main_~d~0#1 < 6); 2383#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2381#L25-3 assume !!(main_~d~0#1 < 6); 2379#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2377#L25-3 assume !!(main_~d~0#1 < 6); 2374#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2373#L25-3 assume !(main_~d~0#1 < 6); 2371#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2369#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2340#L25-3 assume !!(main_~d~0#1 < 6); 2367#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2365#L25-3 assume !!(main_~d~0#1 < 6); 2363#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2361#L25-3 assume !!(main_~d~0#1 < 6); 2359#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2357#L25-3 assume !!(main_~d~0#1 < 6); 2355#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2353#L25-3 assume !!(main_~d~0#1 < 6); 2351#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2349#L25-3 assume !!(main_~d~0#1 < 6); 2346#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2345#L25-3 assume !(main_~d~0#1 < 6); 2343#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2339#L24-3 assume !(main_~c~0#1 < 6); 2338#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2337#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2336#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2335#L25-3 assume !!(main_~d~0#1 < 6); 2334#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2333#L25-3 assume !!(main_~d~0#1 < 6); 2332#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2331#L25-3 assume !!(main_~d~0#1 < 6); 2330#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2329#L25-3 assume !!(main_~d~0#1 < 6); 2328#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2327#L25-3 assume !!(main_~d~0#1 < 6); 2326#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2325#L25-3 assume !!(main_~d~0#1 < 6); 2324#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2323#L25-3 assume !(main_~d~0#1 < 6); 2322#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2321#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2320#L25-3 assume !!(main_~d~0#1 < 6); 2319#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2318#L25-3 assume !!(main_~d~0#1 < 6); 2317#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2316#L25-3 assume !!(main_~d~0#1 < 6); 2315#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2314#L25-3 assume !!(main_~d~0#1 < 6); 2313#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2312#L25-3 assume !!(main_~d~0#1 < 6); 2311#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2310#L25-3 assume !!(main_~d~0#1 < 6); 2309#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2308#L25-3 assume !(main_~d~0#1 < 6); 2307#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2306#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2305#L25-3 assume !!(main_~d~0#1 < 6); 2304#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2303#L25-3 assume !!(main_~d~0#1 < 6); 2302#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2301#L25-3 assume !!(main_~d~0#1 < 6); 2300#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2299#L25-3 assume !!(main_~d~0#1 < 6); 2298#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2297#L25-3 assume !!(main_~d~0#1 < 6); 2296#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2295#L25-3 assume !!(main_~d~0#1 < 6); 2294#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2293#L25-3 assume !(main_~d~0#1 < 6); 2292#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2291#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2290#L25-3 assume !!(main_~d~0#1 < 6); 2289#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2288#L25-3 assume !!(main_~d~0#1 < 6); 2287#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2286#L25-3 assume !!(main_~d~0#1 < 6); 2285#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2284#L25-3 assume !!(main_~d~0#1 < 6); 2283#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2282#L25-3 assume !!(main_~d~0#1 < 6); 2281#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2280#L25-3 assume !!(main_~d~0#1 < 6); 2279#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2278#L25-3 assume !(main_~d~0#1 < 6); 2277#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2276#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2275#L25-3 assume !!(main_~d~0#1 < 6); 2274#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2273#L25-3 assume !!(main_~d~0#1 < 6); 2272#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2271#L25-3 assume !!(main_~d~0#1 < 6); 2270#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2269#L25-3 assume !!(main_~d~0#1 < 6); 2268#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2267#L25-3 assume !!(main_~d~0#1 < 6); 2266#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2265#L25-3 assume !!(main_~d~0#1 < 6); 2264#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2263#L25-3 assume !(main_~d~0#1 < 6); 2262#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2261#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2247#L25-3 assume !!(main_~d~0#1 < 6); 2260#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2259#L25-3 assume !!(main_~d~0#1 < 6); 2258#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2257#L25-3 assume !!(main_~d~0#1 < 6); 2256#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2255#L25-3 assume !!(main_~d~0#1 < 6); 2254#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2253#L25-3 assume !!(main_~d~0#1 < 6); 2252#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2251#L25-3 assume !!(main_~d~0#1 < 6); 2250#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2249#L25-3 assume !(main_~d~0#1 < 6); 2248#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2246#L24-3 assume !(main_~c~0#1 < 6); 2245#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2244#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2152#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2243#L25-3 assume !!(main_~d~0#1 < 6); 2242#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2241#L25-3 assume !!(main_~d~0#1 < 6); 2240#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2239#L25-3 assume !!(main_~d~0#1 < 6); 2238#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2237#L25-3 assume !!(main_~d~0#1 < 6); 2236#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2235#L25-3 assume !!(main_~d~0#1 < 6); 2234#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2233#L25-3 assume !!(main_~d~0#1 < 6); 2232#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2231#L25-3 assume !(main_~d~0#1 < 6); 2230#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2229#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2228#L25-3 assume !!(main_~d~0#1 < 6); 2227#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2226#L25-3 assume !!(main_~d~0#1 < 6); 2225#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2224#L25-3 assume !!(main_~d~0#1 < 6); 2223#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2222#L25-3 assume !!(main_~d~0#1 < 6); 2221#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2220#L25-3 assume !!(main_~d~0#1 < 6); 2219#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2218#L25-3 assume !!(main_~d~0#1 < 6); 2217#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2216#L25-3 assume !(main_~d~0#1 < 6); 2215#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2214#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2213#L25-3 assume !!(main_~d~0#1 < 6); 2212#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2211#L25-3 assume !!(main_~d~0#1 < 6); 2210#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2209#L25-3 assume !!(main_~d~0#1 < 6); 2208#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2207#L25-3 assume !!(main_~d~0#1 < 6); 2206#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2205#L25-3 assume !!(main_~d~0#1 < 6); 2204#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2203#L25-3 assume !!(main_~d~0#1 < 6); 2202#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2201#L25-3 assume !(main_~d~0#1 < 6); 2200#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2199#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2198#L25-3 assume !!(main_~d~0#1 < 6); 2197#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2196#L25-3 assume !!(main_~d~0#1 < 6); 2195#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2194#L25-3 assume !!(main_~d~0#1 < 6); 2193#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2192#L25-3 assume !!(main_~d~0#1 < 6); 2191#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2190#L25-3 assume !!(main_~d~0#1 < 6); 2189#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2188#L25-3 assume !!(main_~d~0#1 < 6); 2187#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2186#L25-3 assume !(main_~d~0#1 < 6); 2185#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2184#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2183#L25-3 assume !!(main_~d~0#1 < 6); 2182#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2181#L25-3 assume !!(main_~d~0#1 < 6); 2180#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2179#L25-3 assume !!(main_~d~0#1 < 6); 2178#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2177#L25-3 assume !!(main_~d~0#1 < 6); 2176#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2175#L25-3 assume !!(main_~d~0#1 < 6); 2174#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2173#L25-3 assume !!(main_~d~0#1 < 6); 2172#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2171#L25-3 assume !(main_~d~0#1 < 6); 2170#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2169#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2155#L25-3 assume !!(main_~d~0#1 < 6); 2168#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2167#L25-3 assume !!(main_~d~0#1 < 6); 2166#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2165#L25-3 assume !!(main_~d~0#1 < 6); 2164#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2163#L25-3 assume !!(main_~d~0#1 < 6); 2162#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2161#L25-3 assume !!(main_~d~0#1 < 6); 2160#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2159#L25-3 assume !!(main_~d~0#1 < 6); 2158#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2157#L25-3 assume !(main_~d~0#1 < 6); 2156#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2154#L24-3 assume !(main_~c~0#1 < 6); 2153#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2151#L23-3 assume !(main_~b~0#1 < 6); 2150#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 2149#L22-3 [2024-11-08 00:19:24,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-08 00:19:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:24,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123787628] [2024-11-08 00:19:24,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:24,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:24,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:24,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:24,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:24,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1738509047, now seen corresponding path program 5 times [2024-11-08 00:19:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261559067] [2024-11-08 00:19:24,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 24994 backedges. 0 proven. 18886 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2024-11-08 00:19:25,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:19:25,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261559067] [2024-11-08 00:19:25,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261559067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:19:25,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42575124] [2024-11-08 00:19:25,267 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 00:19:25,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:19:25,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:25,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:19:25,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 00:19:25,511 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 130 check-sat command(s) [2024-11-08 00:19:25,511 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:19:25,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 00:19:25,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 24994 backedges. 0 proven. 18886 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2024-11-08 00:19:26,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:19:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 24994 backedges. 0 proven. 18886 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2024-11-08 00:19:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42575124] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:19:26,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:19:26,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-08 00:19:26,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220009050] [2024-11-08 00:19:26,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:19:26,595 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:19:26,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:19:26,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 00:19:26,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-08 00:19:26,600 INFO L87 Difference]: Start difference. First operand 377 states and 406 transitions. cyclomatic complexity: 30 Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 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-08 00:19:26,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:19:26,637 INFO L93 Difference]: Finished difference Result 563 states and 606 transitions. [2024-11-08 00:19:26,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 606 transitions. [2024-11-08 00:19:26,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 561 [2024-11-08 00:19:26,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 563 states and 606 transitions. [2024-11-08 00:19:26,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 563 [2024-11-08 00:19:26,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 563 [2024-11-08 00:19:26,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 563 states and 606 transitions. [2024-11-08 00:19:26,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:19:26,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 563 states and 606 transitions. [2024-11-08 00:19:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states and 606 transitions. [2024-11-08 00:19:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2024-11-08 00:19:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 563 states have (on average 1.0763765541740675) internal successors, (606), 562 states have internal predecessors, (606), 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-08 00:19:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 606 transitions. [2024-11-08 00:19:26,677 INFO L240 hiAutomatonCegarLoop]: Abstraction has 563 states and 606 transitions. [2024-11-08 00:19:26,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 00:19:26,680 INFO L425 stractBuchiCegarLoop]: Abstraction has 563 states and 606 transitions. [2024-11-08 00:19:26,680 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-08 00:19:26,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 563 states and 606 transitions. [2024-11-08 00:19:26,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 561 [2024-11-08 00:19:26,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:26,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:26,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:19:26,691 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [216, 216, 36, 36, 36, 6, 6, 6, 1, 1, 1] [2024-11-08 00:19:26,691 INFO L745 eck$LassoCheckResult]: Stem: 5340#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 5341#L-1 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; 5344#L22-3 [2024-11-08 00:19:26,692 INFO L747 eck$LassoCheckResult]: Loop: 5344#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 5342#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5343#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5339#L25-3 assume !!(main_~d~0#1 < 6); 5333#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5334#L25-3 assume !!(main_~d~0#1 < 6); 5891#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5889#L25-3 assume !!(main_~d~0#1 < 6); 5887#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5885#L25-3 assume !!(main_~d~0#1 < 6); 5883#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5881#L25-3 assume !!(main_~d~0#1 < 6); 5879#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5877#L25-3 assume !!(main_~d~0#1 < 6); 5875#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5874#L25-3 assume !(main_~d~0#1 < 6); 5335#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5336#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5869#L25-3 assume !!(main_~d~0#1 < 6); 5867#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5865#L25-3 assume !!(main_~d~0#1 < 6); 5863#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5861#L25-3 assume !!(main_~d~0#1 < 6); 5859#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5857#L25-3 assume !!(main_~d~0#1 < 6); 5855#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5853#L25-3 assume !!(main_~d~0#1 < 6); 5851#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5849#L25-3 assume !!(main_~d~0#1 < 6); 5847#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5846#L25-3 assume !(main_~d~0#1 < 6); 5843#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5841#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5839#L25-3 assume !!(main_~d~0#1 < 6); 5837#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5835#L25-3 assume !!(main_~d~0#1 < 6); 5833#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5831#L25-3 assume !!(main_~d~0#1 < 6); 5829#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5827#L25-3 assume !!(main_~d~0#1 < 6); 5825#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5823#L25-3 assume !!(main_~d~0#1 < 6); 5821#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5819#L25-3 assume !!(main_~d~0#1 < 6); 5817#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5816#L25-3 assume !(main_~d~0#1 < 6); 5813#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5811#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5809#L25-3 assume !!(main_~d~0#1 < 6); 5807#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5805#L25-3 assume !!(main_~d~0#1 < 6); 5803#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5801#L25-3 assume !!(main_~d~0#1 < 6); 5799#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5797#L25-3 assume !!(main_~d~0#1 < 6); 5795#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5793#L25-3 assume !!(main_~d~0#1 < 6); 5791#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5789#L25-3 assume !!(main_~d~0#1 < 6); 5787#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5786#L25-3 assume !(main_~d~0#1 < 6); 5783#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5781#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5779#L25-3 assume !!(main_~d~0#1 < 6); 5777#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5775#L25-3 assume !!(main_~d~0#1 < 6); 5773#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5771#L25-3 assume !!(main_~d~0#1 < 6); 5769#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5767#L25-3 assume !!(main_~d~0#1 < 6); 5765#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5763#L25-3 assume !!(main_~d~0#1 < 6); 5761#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5759#L25-3 assume !!(main_~d~0#1 < 6); 5757#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5756#L25-3 assume !(main_~d~0#1 < 6); 5753#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5751#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5723#L25-3 assume !!(main_~d~0#1 < 6); 5749#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5747#L25-3 assume !!(main_~d~0#1 < 6); 5745#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5743#L25-3 assume !!(main_~d~0#1 < 6); 5741#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5739#L25-3 assume !!(main_~d~0#1 < 6); 5737#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5735#L25-3 assume !!(main_~d~0#1 < 6); 5733#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5731#L25-3 assume !!(main_~d~0#1 < 6); 5729#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5728#L25-3 assume !(main_~d~0#1 < 6); 5725#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5722#L24-3 assume !(main_~c~0#1 < 6); 5337#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5338#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5895#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5894#L25-3 assume !!(main_~d~0#1 < 6); 5893#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5892#L25-3 assume !!(main_~d~0#1 < 6); 5890#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5888#L25-3 assume !!(main_~d~0#1 < 6); 5886#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5884#L25-3 assume !!(main_~d~0#1 < 6); 5882#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5880#L25-3 assume !!(main_~d~0#1 < 6); 5878#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5876#L25-3 assume !!(main_~d~0#1 < 6); 5873#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5872#L25-3 assume !(main_~d~0#1 < 6); 5871#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5870#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5868#L25-3 assume !!(main_~d~0#1 < 6); 5866#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5864#L25-3 assume !!(main_~d~0#1 < 6); 5862#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5860#L25-3 assume !!(main_~d~0#1 < 6); 5858#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5856#L25-3 assume !!(main_~d~0#1 < 6); 5854#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5852#L25-3 assume !!(main_~d~0#1 < 6); 5850#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5848#L25-3 assume !!(main_~d~0#1 < 6); 5845#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5844#L25-3 assume !(main_~d~0#1 < 6); 5842#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5840#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5838#L25-3 assume !!(main_~d~0#1 < 6); 5836#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5834#L25-3 assume !!(main_~d~0#1 < 6); 5832#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5830#L25-3 assume !!(main_~d~0#1 < 6); 5828#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5826#L25-3 assume !!(main_~d~0#1 < 6); 5824#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5822#L25-3 assume !!(main_~d~0#1 < 6); 5820#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5818#L25-3 assume !!(main_~d~0#1 < 6); 5815#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5814#L25-3 assume !(main_~d~0#1 < 6); 5812#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5810#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5808#L25-3 assume !!(main_~d~0#1 < 6); 5806#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5804#L25-3 assume !!(main_~d~0#1 < 6); 5802#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5800#L25-3 assume !!(main_~d~0#1 < 6); 5798#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5796#L25-3 assume !!(main_~d~0#1 < 6); 5794#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5792#L25-3 assume !!(main_~d~0#1 < 6); 5790#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5788#L25-3 assume !!(main_~d~0#1 < 6); 5785#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5784#L25-3 assume !(main_~d~0#1 < 6); 5782#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5780#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5778#L25-3 assume !!(main_~d~0#1 < 6); 5776#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5774#L25-3 assume !!(main_~d~0#1 < 6); 5772#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5770#L25-3 assume !!(main_~d~0#1 < 6); 5768#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5766#L25-3 assume !!(main_~d~0#1 < 6); 5764#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5762#L25-3 assume !!(main_~d~0#1 < 6); 5760#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5758#L25-3 assume !!(main_~d~0#1 < 6); 5755#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5754#L25-3 assume !(main_~d~0#1 < 6); 5752#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5750#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5721#L25-3 assume !!(main_~d~0#1 < 6); 5748#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5746#L25-3 assume !!(main_~d~0#1 < 6); 5744#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5742#L25-3 assume !!(main_~d~0#1 < 6); 5740#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5738#L25-3 assume !!(main_~d~0#1 < 6); 5736#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5734#L25-3 assume !!(main_~d~0#1 < 6); 5732#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5730#L25-3 assume !!(main_~d~0#1 < 6); 5727#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5726#L25-3 assume !(main_~d~0#1 < 6); 5724#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5720#L24-3 assume !(main_~c~0#1 < 6); 5719#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5718#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5717#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5716#L25-3 assume !!(main_~d~0#1 < 6); 5715#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5714#L25-3 assume !!(main_~d~0#1 < 6); 5713#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5712#L25-3 assume !!(main_~d~0#1 < 6); 5711#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5710#L25-3 assume !!(main_~d~0#1 < 6); 5709#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5708#L25-3 assume !!(main_~d~0#1 < 6); 5707#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5706#L25-3 assume !!(main_~d~0#1 < 6); 5705#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5704#L25-3 assume !(main_~d~0#1 < 6); 5703#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5702#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5701#L25-3 assume !!(main_~d~0#1 < 6); 5700#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5699#L25-3 assume !!(main_~d~0#1 < 6); 5698#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5697#L25-3 assume !!(main_~d~0#1 < 6); 5696#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5695#L25-3 assume !!(main_~d~0#1 < 6); 5694#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5693#L25-3 assume !!(main_~d~0#1 < 6); 5692#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5691#L25-3 assume !!(main_~d~0#1 < 6); 5690#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5689#L25-3 assume !(main_~d~0#1 < 6); 5688#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5687#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5686#L25-3 assume !!(main_~d~0#1 < 6); 5685#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5684#L25-3 assume !!(main_~d~0#1 < 6); 5683#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5682#L25-3 assume !!(main_~d~0#1 < 6); 5681#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5680#L25-3 assume !!(main_~d~0#1 < 6); 5679#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5678#L25-3 assume !!(main_~d~0#1 < 6); 5677#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5676#L25-3 assume !!(main_~d~0#1 < 6); 5675#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5674#L25-3 assume !(main_~d~0#1 < 6); 5673#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5672#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5671#L25-3 assume !!(main_~d~0#1 < 6); 5670#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5669#L25-3 assume !!(main_~d~0#1 < 6); 5668#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5667#L25-3 assume !!(main_~d~0#1 < 6); 5666#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5665#L25-3 assume !!(main_~d~0#1 < 6); 5664#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5663#L25-3 assume !!(main_~d~0#1 < 6); 5662#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5661#L25-3 assume !!(main_~d~0#1 < 6); 5660#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5659#L25-3 assume !(main_~d~0#1 < 6); 5658#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5657#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5656#L25-3 assume !!(main_~d~0#1 < 6); 5655#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5654#L25-3 assume !!(main_~d~0#1 < 6); 5653#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5652#L25-3 assume !!(main_~d~0#1 < 6); 5651#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5650#L25-3 assume !!(main_~d~0#1 < 6); 5649#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5648#L25-3 assume !!(main_~d~0#1 < 6); 5647#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5646#L25-3 assume !!(main_~d~0#1 < 6); 5645#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5644#L25-3 assume !(main_~d~0#1 < 6); 5643#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5642#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5628#L25-3 assume !!(main_~d~0#1 < 6); 5641#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5640#L25-3 assume !!(main_~d~0#1 < 6); 5639#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5638#L25-3 assume !!(main_~d~0#1 < 6); 5637#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5636#L25-3 assume !!(main_~d~0#1 < 6); 5635#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5634#L25-3 assume !!(main_~d~0#1 < 6); 5633#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5632#L25-3 assume !!(main_~d~0#1 < 6); 5631#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5630#L25-3 assume !(main_~d~0#1 < 6); 5629#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5627#L24-3 assume !(main_~c~0#1 < 6); 5626#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5625#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5624#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5623#L25-3 assume !!(main_~d~0#1 < 6); 5622#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5621#L25-3 assume !!(main_~d~0#1 < 6); 5620#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5619#L25-3 assume !!(main_~d~0#1 < 6); 5618#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5617#L25-3 assume !!(main_~d~0#1 < 6); 5616#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5615#L25-3 assume !!(main_~d~0#1 < 6); 5614#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5613#L25-3 assume !!(main_~d~0#1 < 6); 5612#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5611#L25-3 assume !(main_~d~0#1 < 6); 5610#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5609#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5608#L25-3 assume !!(main_~d~0#1 < 6); 5607#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5606#L25-3 assume !!(main_~d~0#1 < 6); 5605#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5604#L25-3 assume !!(main_~d~0#1 < 6); 5603#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5602#L25-3 assume !!(main_~d~0#1 < 6); 5601#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5600#L25-3 assume !!(main_~d~0#1 < 6); 5599#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5598#L25-3 assume !!(main_~d~0#1 < 6); 5597#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5596#L25-3 assume !(main_~d~0#1 < 6); 5595#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5594#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5593#L25-3 assume !!(main_~d~0#1 < 6); 5592#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5591#L25-3 assume !!(main_~d~0#1 < 6); 5590#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5589#L25-3 assume !!(main_~d~0#1 < 6); 5588#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5587#L25-3 assume !!(main_~d~0#1 < 6); 5586#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5585#L25-3 assume !!(main_~d~0#1 < 6); 5584#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5583#L25-3 assume !!(main_~d~0#1 < 6); 5582#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5581#L25-3 assume !(main_~d~0#1 < 6); 5580#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5579#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5578#L25-3 assume !!(main_~d~0#1 < 6); 5577#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5576#L25-3 assume !!(main_~d~0#1 < 6); 5575#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5574#L25-3 assume !!(main_~d~0#1 < 6); 5573#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5572#L25-3 assume !!(main_~d~0#1 < 6); 5571#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5570#L25-3 assume !!(main_~d~0#1 < 6); 5569#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5568#L25-3 assume !!(main_~d~0#1 < 6); 5567#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5566#L25-3 assume !(main_~d~0#1 < 6); 5565#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5564#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5563#L25-3 assume !!(main_~d~0#1 < 6); 5562#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5561#L25-3 assume !!(main_~d~0#1 < 6); 5560#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5559#L25-3 assume !!(main_~d~0#1 < 6); 5558#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5557#L25-3 assume !!(main_~d~0#1 < 6); 5556#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5555#L25-3 assume !!(main_~d~0#1 < 6); 5554#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5553#L25-3 assume !!(main_~d~0#1 < 6); 5552#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5551#L25-3 assume !(main_~d~0#1 < 6); 5550#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5549#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5535#L25-3 assume !!(main_~d~0#1 < 6); 5548#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5547#L25-3 assume !!(main_~d~0#1 < 6); 5546#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5545#L25-3 assume !!(main_~d~0#1 < 6); 5544#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5543#L25-3 assume !!(main_~d~0#1 < 6); 5542#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5541#L25-3 assume !!(main_~d~0#1 < 6); 5540#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5539#L25-3 assume !!(main_~d~0#1 < 6); 5538#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5537#L25-3 assume !(main_~d~0#1 < 6); 5536#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5534#L24-3 assume !(main_~c~0#1 < 6); 5533#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5532#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5531#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5530#L25-3 assume !!(main_~d~0#1 < 6); 5529#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5528#L25-3 assume !!(main_~d~0#1 < 6); 5527#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5526#L25-3 assume !!(main_~d~0#1 < 6); 5525#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5524#L25-3 assume !!(main_~d~0#1 < 6); 5523#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5522#L25-3 assume !!(main_~d~0#1 < 6); 5521#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5520#L25-3 assume !!(main_~d~0#1 < 6); 5519#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5518#L25-3 assume !(main_~d~0#1 < 6); 5517#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5516#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5515#L25-3 assume !!(main_~d~0#1 < 6); 5514#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5513#L25-3 assume !!(main_~d~0#1 < 6); 5512#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5511#L25-3 assume !!(main_~d~0#1 < 6); 5510#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5509#L25-3 assume !!(main_~d~0#1 < 6); 5508#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5507#L25-3 assume !!(main_~d~0#1 < 6); 5506#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5505#L25-3 assume !!(main_~d~0#1 < 6); 5504#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5503#L25-3 assume !(main_~d~0#1 < 6); 5502#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5501#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5500#L25-3 assume !!(main_~d~0#1 < 6); 5499#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5498#L25-3 assume !!(main_~d~0#1 < 6); 5497#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5496#L25-3 assume !!(main_~d~0#1 < 6); 5495#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5494#L25-3 assume !!(main_~d~0#1 < 6); 5493#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5492#L25-3 assume !!(main_~d~0#1 < 6); 5491#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5490#L25-3 assume !!(main_~d~0#1 < 6); 5489#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5488#L25-3 assume !(main_~d~0#1 < 6); 5487#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5486#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5485#L25-3 assume !!(main_~d~0#1 < 6); 5484#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5483#L25-3 assume !!(main_~d~0#1 < 6); 5482#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5481#L25-3 assume !!(main_~d~0#1 < 6); 5480#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5479#L25-3 assume !!(main_~d~0#1 < 6); 5478#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5477#L25-3 assume !!(main_~d~0#1 < 6); 5476#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5475#L25-3 assume !!(main_~d~0#1 < 6); 5474#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5473#L25-3 assume !(main_~d~0#1 < 6); 5472#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5471#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5470#L25-3 assume !!(main_~d~0#1 < 6); 5469#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5468#L25-3 assume !!(main_~d~0#1 < 6); 5467#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5466#L25-3 assume !!(main_~d~0#1 < 6); 5465#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5464#L25-3 assume !!(main_~d~0#1 < 6); 5463#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5462#L25-3 assume !!(main_~d~0#1 < 6); 5461#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5460#L25-3 assume !!(main_~d~0#1 < 6); 5459#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5458#L25-3 assume !(main_~d~0#1 < 6); 5457#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5456#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5442#L25-3 assume !!(main_~d~0#1 < 6); 5455#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5454#L25-3 assume !!(main_~d~0#1 < 6); 5453#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5452#L25-3 assume !!(main_~d~0#1 < 6); 5451#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5450#L25-3 assume !!(main_~d~0#1 < 6); 5449#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5448#L25-3 assume !!(main_~d~0#1 < 6); 5447#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5446#L25-3 assume !!(main_~d~0#1 < 6); 5445#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5444#L25-3 assume !(main_~d~0#1 < 6); 5443#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5441#L24-3 assume !(main_~c~0#1 < 6); 5440#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5439#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5347#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5438#L25-3 assume !!(main_~d~0#1 < 6); 5437#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5436#L25-3 assume !!(main_~d~0#1 < 6); 5435#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5434#L25-3 assume !!(main_~d~0#1 < 6); 5433#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5432#L25-3 assume !!(main_~d~0#1 < 6); 5431#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5430#L25-3 assume !!(main_~d~0#1 < 6); 5429#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5428#L25-3 assume !!(main_~d~0#1 < 6); 5427#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5426#L25-3 assume !(main_~d~0#1 < 6); 5425#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5424#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5423#L25-3 assume !!(main_~d~0#1 < 6); 5422#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5421#L25-3 assume !!(main_~d~0#1 < 6); 5420#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5419#L25-3 assume !!(main_~d~0#1 < 6); 5418#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5417#L25-3 assume !!(main_~d~0#1 < 6); 5416#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5415#L25-3 assume !!(main_~d~0#1 < 6); 5414#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5413#L25-3 assume !!(main_~d~0#1 < 6); 5412#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5411#L25-3 assume !(main_~d~0#1 < 6); 5410#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5409#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5408#L25-3 assume !!(main_~d~0#1 < 6); 5407#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5406#L25-3 assume !!(main_~d~0#1 < 6); 5405#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5404#L25-3 assume !!(main_~d~0#1 < 6); 5403#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5402#L25-3 assume !!(main_~d~0#1 < 6); 5401#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5400#L25-3 assume !!(main_~d~0#1 < 6); 5399#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5398#L25-3 assume !!(main_~d~0#1 < 6); 5397#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5396#L25-3 assume !(main_~d~0#1 < 6); 5395#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5394#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5393#L25-3 assume !!(main_~d~0#1 < 6); 5392#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5391#L25-3 assume !!(main_~d~0#1 < 6); 5390#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5389#L25-3 assume !!(main_~d~0#1 < 6); 5388#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5387#L25-3 assume !!(main_~d~0#1 < 6); 5386#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5385#L25-3 assume !!(main_~d~0#1 < 6); 5384#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5383#L25-3 assume !!(main_~d~0#1 < 6); 5382#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5381#L25-3 assume !(main_~d~0#1 < 6); 5380#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5379#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5378#L25-3 assume !!(main_~d~0#1 < 6); 5377#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5376#L25-3 assume !!(main_~d~0#1 < 6); 5375#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5374#L25-3 assume !!(main_~d~0#1 < 6); 5373#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5372#L25-3 assume !!(main_~d~0#1 < 6); 5371#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5370#L25-3 assume !!(main_~d~0#1 < 6); 5369#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5368#L25-3 assume !!(main_~d~0#1 < 6); 5367#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5366#L25-3 assume !(main_~d~0#1 < 6); 5365#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5364#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5350#L25-3 assume !!(main_~d~0#1 < 6); 5363#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5362#L25-3 assume !!(main_~d~0#1 < 6); 5361#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5360#L25-3 assume !!(main_~d~0#1 < 6); 5359#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5358#L25-3 assume !!(main_~d~0#1 < 6); 5357#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5356#L25-3 assume !!(main_~d~0#1 < 6); 5355#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5354#L25-3 assume !!(main_~d~0#1 < 6); 5353#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5352#L25-3 assume !(main_~d~0#1 < 6); 5351#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5349#L24-3 assume !(main_~c~0#1 < 6); 5348#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5346#L23-3 assume !(main_~b~0#1 < 6); 5345#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 5344#L22-3 [2024-11-08 00:19:26,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-08 00:19:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:26,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703347521] [2024-11-08 00:19:26,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:26,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:26,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:26,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:26,701 INFO L85 PathProgramCache]: Analyzing trace with hash 247558537, now seen corresponding path program 6 times [2024-11-08 00:19:26,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:26,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372210728] [2024-11-08 00:19:26,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:26,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:26,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:26,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:26,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:26,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1915499015, now seen corresponding path program 1 times [2024-11-08 00:19:26,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:27,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678575832] [2024-11-08 00:19:27,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:27,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:27,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:42,685 WARN L286 SmtUtils]: Spent 15.24s on a formula simplification. DAG size of input: 1170 DAG size of output: 870 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-08 00:19:44,886 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:44,887 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:44,887 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:44,887 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:44,888 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-08 00:19:44,888 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:44,888 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:44,889 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:44,889 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration9_Loop [2024-11-08 00:19:44,889 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:44,889 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:44,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:44,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:44,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:44,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:44,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:44,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:44,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:44,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:44,983 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:44,983 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-08 00:19:44,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:44,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:44,987 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:44,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-08 00:19:44,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:44,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:45,011 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:45,011 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-08 00:19:45,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-08 00:19:45,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,031 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-08 00:19:45,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:45,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:45,054 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:45,054 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-08 00:19:45,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-08 00:19:45,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,073 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-08 00:19:45,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:45,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:45,092 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:45,092 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-08 00:19:45,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-08 00:19:45,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,110 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-08 00:19:45,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:45,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:45,127 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:45,128 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-08 00:19:45,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-08 00:19:45,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,148 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:45,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:45,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-08 00:19:45,167 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:45,167 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-08 00:19:45,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-08 00:19:45,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,184 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-08 00:19:45,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:45,190 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:45,208 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:45,208 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-08 00:19:45,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-08 00:19:45,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,225 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-08 00:19:45,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:45,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:45,243 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:45,243 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-08 00:19:45,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-08 00:19:45,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,260 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-08 00:19:45,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:45,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:45,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-08 00:19:45,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,295 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-08 00:19:45,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-08 00:19:45,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:45,334 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-08 00:19:45,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-08 00:19:45,339 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:45,339 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:45,340 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:45,340 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:45,340 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 00:19:45,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:45,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:45,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration9_Loop [2024-11-08 00:19:45,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:45,340 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:45,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:45,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:45,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:45,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:45,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:45,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:45,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:45,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:45,410 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:45,414 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 00:19:45,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,418 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-08 00:19:45,421 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-08 00:19:45,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:45,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:45,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:45,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:45,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:45,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:45,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:45,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:45,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-08 00:19:45,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,462 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-08 00:19:45,466 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-08 00:19:45,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:45,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:45,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:45,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:45,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:45,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:45,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:45,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:45,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:45,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,501 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-08 00:19:45,504 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-08 00:19:45,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:45,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:45,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:45,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:45,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:45,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:45,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:45,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:45,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-08 00:19:45,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,537 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-08 00:19:45,539 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-08 00:19:45,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:45,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:45,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:45,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:45,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:45,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:45,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:45,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:45,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-08 00:19:45,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,576 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-08 00:19:45,579 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-08 00:19:45,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:45,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:45,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:45,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:45,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:45,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:45,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:45,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:45,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-08 00:19:45,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,612 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-08 00:19:45,615 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-08 00:19:45,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:45,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:45,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:45,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:45,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:45,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:45,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:45,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:45,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:45,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,650 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-08 00:19:45,653 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-08 00:19:45,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:45,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:45,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:45,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:45,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:45,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:45,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:45,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:45,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-08 00:19:45,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,680 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-08 00:19:45,682 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-08 00:19:45,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:45,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:45,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:45,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:45,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:45,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:45,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:45,696 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 00:19:45,701 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-08 00:19:45,704 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-08 00:19:45,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:45,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:45,709 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:45,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-08 00:19:45,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 00:19:45,711 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-08 00:19:45,711 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 00:19:45,712 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-08 00:19:45,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-08 00:19:45,729 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-08 00:19:45,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:45,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:45,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:45,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:45,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:46,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-08 00:19:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 56373 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56373 trivial. 0 not checked. [2024-11-08 00:19:47,901 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-08 00:19:47,902 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 563 states and 606 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-08 00:19:47,950 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 563 states and 606 transitions. cyclomatic complexity: 44. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 1124 states and 1211 transitions. Complement of second has 4 states. [2024-11-08 00:19:47,952 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-08 00:19:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-08 00:19:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-08 00:19:47,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 2 letters. Loop has 561 letters. [2024-11-08 00:19:47,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:47,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 563 letters. Loop has 561 letters. [2024-11-08 00:19:47,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:47,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 2 letters. Loop has 1122 letters. [2024-11-08 00:19:47,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:47,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1124 states and 1211 transitions. [2024-11-08 00:19:47,982 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 218 [2024-11-08 00:19:47,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1124 states to 1123 states and 1210 transitions. [2024-11-08 00:19:47,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2024-11-08 00:19:47,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2024-11-08 00:19:47,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1123 states and 1210 transitions. [2024-11-08 00:19:47,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 00:19:47,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1123 states and 1210 transitions. [2024-11-08 00:19:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states and 1210 transitions. [2024-11-08 00:19:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 657. [2024-11-08 00:19:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 657 states have (on average 1.0791476407914764) internal successors, (709), 656 states have internal predecessors, (709), 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-08 00:19:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 709 transitions. [2024-11-08 00:19:48,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 657 states and 709 transitions. [2024-11-08 00:19:48,008 INFO L425 stractBuchiCegarLoop]: Abstraction has 657 states and 709 transitions. [2024-11-08 00:19:48,009 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-08 00:19:48,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 657 states and 709 transitions. [2024-11-08 00:19:48,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-11-08 00:19:48,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:48,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:48,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:19:48,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 6, 6, 6, 1, 1, 1] [2024-11-08 00:19:48,013 INFO L745 eck$LassoCheckResult]: Stem: 8742#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 8743#L-1 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; 8747#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 8737#L23-3 [2024-11-08 00:19:48,013 INFO L747 eck$LassoCheckResult]: Loop: 8737#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 8744#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 8740#L25-3 assume !!(main_~d~0#1 < 6); 8728#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 8729#L25-3 assume !!(main_~d~0#1 < 6); 9381#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9379#L25-3 assume !!(main_~d~0#1 < 6); 9377#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9375#L25-3 assume !!(main_~d~0#1 < 6); 9373#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9371#L25-3 assume !!(main_~d~0#1 < 6); 9369#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9367#L25-3 assume !!(main_~d~0#1 < 6); 9365#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9364#L25-3 assume !(main_~d~0#1 < 6); 8732#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 8733#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 9384#L25-3 assume !!(main_~d~0#1 < 6); 9383#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9382#L25-3 assume !!(main_~d~0#1 < 6); 9380#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9378#L25-3 assume !!(main_~d~0#1 < 6); 9376#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9374#L25-3 assume !!(main_~d~0#1 < 6); 9372#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9370#L25-3 assume !!(main_~d~0#1 < 6); 9368#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9366#L25-3 assume !!(main_~d~0#1 < 6); 9363#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9362#L25-3 assume !(main_~d~0#1 < 6); 9361#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 9360#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 9359#L25-3 assume !!(main_~d~0#1 < 6); 9358#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9357#L25-3 assume !!(main_~d~0#1 < 6); 9356#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9355#L25-3 assume !!(main_~d~0#1 < 6); 9354#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9353#L25-3 assume !!(main_~d~0#1 < 6); 9352#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9351#L25-3 assume !!(main_~d~0#1 < 6); 9350#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9349#L25-3 assume !!(main_~d~0#1 < 6); 9348#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9347#L25-3 assume !(main_~d~0#1 < 6); 9346#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 9345#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 9344#L25-3 assume !!(main_~d~0#1 < 6); 9343#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9342#L25-3 assume !!(main_~d~0#1 < 6); 9341#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9340#L25-3 assume !!(main_~d~0#1 < 6); 9339#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9338#L25-3 assume !!(main_~d~0#1 < 6); 9337#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9336#L25-3 assume !!(main_~d~0#1 < 6); 9335#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9334#L25-3 assume !!(main_~d~0#1 < 6); 9333#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9332#L25-3 assume !(main_~d~0#1 < 6); 9331#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 9330#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 9329#L25-3 assume !!(main_~d~0#1 < 6); 9328#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9327#L25-3 assume !!(main_~d~0#1 < 6); 9326#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9325#L25-3 assume !!(main_~d~0#1 < 6); 9324#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9323#L25-3 assume !!(main_~d~0#1 < 6); 9322#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9321#L25-3 assume !!(main_~d~0#1 < 6); 9320#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9319#L25-3 assume !!(main_~d~0#1 < 6); 9318#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9317#L25-3 assume !(main_~d~0#1 < 6); 9316#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 9315#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 9301#L25-3 assume !!(main_~d~0#1 < 6); 9314#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9313#L25-3 assume !!(main_~d~0#1 < 6); 9312#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9311#L25-3 assume !!(main_~d~0#1 < 6); 9310#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9309#L25-3 assume !!(main_~d~0#1 < 6); 9308#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9307#L25-3 assume !!(main_~d~0#1 < 6); 9306#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9305#L25-3 assume !!(main_~d~0#1 < 6); 9304#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9303#L25-3 assume !(main_~d~0#1 < 6); 9302#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 9300#L24-3 assume !(main_~c~0#1 < 6); 8736#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 8737#L23-3 [2024-11-08 00:19:48,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-08 00:19:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:48,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466189054] [2024-11-08 00:19:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:48,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:48,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:48,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:48,029 INFO L85 PathProgramCache]: Analyzing trace with hash -298958203, now seen corresponding path program 1 times [2024-11-08 00:19:48,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:48,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117158589] [2024-11-08 00:19:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:48,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:48,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:48,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:48,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1137457249, now seen corresponding path program 1 times [2024-11-08 00:19:48,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:48,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543485160] [2024-11-08 00:19:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:48,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:48,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:48,816 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:48,816 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:48,816 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:48,816 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:48,816 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-08 00:19:48,816 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:48,816 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:48,816 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:48,816 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration10_Loop [2024-11-08 00:19:48,817 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:48,817 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:48,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:48,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:48,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:48,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:48,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:48,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:48,867 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:48,868 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-08 00:19:48,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:48,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:48,870 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:48,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-08 00:19:48,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:48,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:48,891 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:48,891 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-08 00:19:48,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-08 00:19:48,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:48,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:48,908 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:48,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-08 00:19:48,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:48,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:48,926 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:48,927 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-08 00:19:48,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-08 00:19:48,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:48,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:48,945 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:48,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:48,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:48,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-08 00:19:48,962 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:48,963 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-08 00:19:48,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-08 00:19:48,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:48,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:48,981 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:48,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-08 00:19:48,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:48,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:49,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-08 00:19:49,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:49,009 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:49,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-08 00:19:49,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-08 00:19:49,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:49,045 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-08 00:19:49,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-08 00:19:49,051 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:49,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:49,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:49,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:49,051 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 00:19:49,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:49,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:49,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration10_Loop [2024-11-08 00:19:49,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:49,051 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:49,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,096 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:49,096 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 00:19:49,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:49,101 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:49,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-08 00:19:49,102 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-08 00:19:49,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:49,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:49,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:49,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:49,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:49,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:49,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:49,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:49,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-08 00:19:49,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:49,128 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:49,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-08 00:19:49,131 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-08 00:19:49,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:49,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:49,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:49,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:49,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:49,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:49,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:49,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:49,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-08 00:19:49,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:49,156 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:49,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-08 00:19:49,158 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-08 00:19:49,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:49,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:49,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:49,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:49,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:49,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:49,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:49,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:49,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-08 00:19:49,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:49,183 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:49,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-08 00:19:49,185 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-08 00:19:49,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:49,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:49,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:49,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:49,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:49,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:49,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:49,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:49,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-08 00:19:49,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:49,215 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:49,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-08 00:19:49,216 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-08 00:19:49,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:49,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:49,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:49,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:49,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:49,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:49,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:49,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 00:19:49,238 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-08 00:19:49,238 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-08 00:19:49,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:49,241 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:49,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-08 00:19:49,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 00:19:49,244 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-08 00:19:49,244 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 00:19:49,244 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-08 00:19:49,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-08 00:19:49,260 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-08 00:19:49,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:49,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:49,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:49,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:49,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-11-08 00:19:49,591 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-08 00:19:49,591 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 657 states and 709 transitions. cyclomatic complexity: 54 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-08 00:19:49,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 657 states and 709 transitions. cyclomatic complexity: 54. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 1958 states and 2112 transitions. Complement of second has 7 states. [2024-11-08 00:19:49,626 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-08 00:19:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-08 00:19:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-08 00:19:49,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 3 letters. Loop has 93 letters. [2024-11-08 00:19:49,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:49,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 96 letters. Loop has 93 letters. [2024-11-08 00:19:49,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:49,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 3 letters. Loop has 186 letters. [2024-11-08 00:19:49,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:49,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1958 states and 2112 transitions. [2024-11-08 00:19:49,650 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 118 [2024-11-08 00:19:49,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1958 states to 1403 states and 1514 transitions. [2024-11-08 00:19:49,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2024-11-08 00:19:49,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2024-11-08 00:19:49,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1403 states and 1514 transitions. [2024-11-08 00:19:49,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 00:19:49,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1403 states and 1514 transitions. [2024-11-08 00:19:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states and 1514 transitions. [2024-11-08 00:19:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 766. [2024-11-08 00:19:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 766 states have (on average 1.080939947780679) internal successors, (828), 765 states have internal predecessors, (828), 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-08 00:19:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 828 transitions. [2024-11-08 00:19:49,687 INFO L240 hiAutomatonCegarLoop]: Abstraction has 766 states and 828 transitions. [2024-11-08 00:19:49,687 INFO L425 stractBuchiCegarLoop]: Abstraction has 766 states and 828 transitions. [2024-11-08 00:19:49,687 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-08 00:19:49,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 766 states and 828 transitions. [2024-11-08 00:19:49,691 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2024-11-08 00:19:49,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:49,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:49,692 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-08 00:19:49,692 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-08 00:19:49,692 INFO L745 eck$LassoCheckResult]: Stem: 11669#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 11670#L-1 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; 11675#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11671#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 11659#L24-3 [2024-11-08 00:19:49,692 INFO L747 eck$LassoCheckResult]: Loop: 11659#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 11666#L25-3 assume !!(main_~d~0#1 < 6); 11654#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 11655#L25-3 assume !!(main_~d~0#1 < 6); 12419#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 12418#L25-3 assume !!(main_~d~0#1 < 6); 12417#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 12416#L25-3 assume !!(main_~d~0#1 < 6); 12415#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 12414#L25-3 assume !!(main_~d~0#1 < 6); 12413#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 12412#L25-3 assume !!(main_~d~0#1 < 6); 12390#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 12389#L25-3 assume !(main_~d~0#1 < 6); 11658#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 11659#L24-3 [2024-11-08 00:19:49,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:49,693 INFO L85 PathProgramCache]: Analyzing trace with hash 925771, now seen corresponding path program 1 times [2024-11-08 00:19:49,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:49,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073155308] [2024-11-08 00:19:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:49,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:49,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:49,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:49,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:49,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1161196429, now seen corresponding path program 1 times [2024-11-08 00:19:49,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:49,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262664824] [2024-11-08 00:19:49,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:49,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:49,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:49,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:49,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -682723837, now seen corresponding path program 1 times [2024-11-08 00:19:49,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:49,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142643194] [2024-11-08 00:19:49,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:49,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:49,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:49,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:49,771 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:49,771 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:49,772 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:49,772 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:49,772 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-08 00:19:49,772 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,772 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:49,772 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:49,772 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration11_Loop [2024-11-08 00:19:49,772 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:49,772 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:49,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,808 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:49,809 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-08 00:19:49,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:49,811 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:49,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-08 00:19:49,814 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:49,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:49,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-08 00:19:49,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:49,849 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:49,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-08 00:19:49,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-08 00:19:49,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:49,882 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-08 00:19:49,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-08 00:19:49,887 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:49,887 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:49,887 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:49,887 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:49,887 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 00:19:49,887 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,887 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:49,887 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:49,887 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration11_Loop [2024-11-08 00:19:49,887 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:49,887 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:49,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:49,918 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:49,918 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 00:19:49,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:49,920 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:49,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-08 00:19:49,922 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-08 00:19:49,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:49,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:49,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:49,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:49,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:49,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:49,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:49,935 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 00:19:49,936 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-08 00:19:49,936 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-08 00:19:49,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:49,939 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:49,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-08 00:19:49,941 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 00:19:49,941 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-08 00:19:49,941 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 00:19:49,941 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-08 00:19:49,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-08 00:19:49,953 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-08 00:19:49,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:49,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:49,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:49,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:49,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 00:19:50,045 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-08 00:19:50,045 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 766 states and 828 transitions. cyclomatic complexity: 66 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-08 00:19:50,071 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 766 states and 828 transitions. cyclomatic complexity: 66. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 1155 states and 1249 transitions. Complement of second has 7 states. [2024-11-08 00:19:50,072 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-08 00:19:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-08 00:19:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-11-08 00:19:50,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 15 letters. [2024-11-08 00:19:50,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:50,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 19 letters. Loop has 15 letters. [2024-11-08 00:19:50,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:50,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 30 letters. [2024-11-08 00:19:50,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:50,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1155 states and 1249 transitions. [2024-11-08 00:19:50,082 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2024-11-08 00:19:50,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1155 states to 982 states and 1062 transitions. [2024-11-08 00:19:50,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2024-11-08 00:19:50,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-11-08 00:19:50,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 982 states and 1062 transitions. [2024-11-08 00:19:50,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 00:19:50,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 982 states and 1062 transitions. [2024-11-08 00:19:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states and 1062 transitions. [2024-11-08 00:19:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 784. [2024-11-08 00:19:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 784 states have (on average 1.0829081632653061) internal successors, (849), 783 states have internal predecessors, (849), 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-08 00:19:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2024-11-08 00:19:50,110 INFO L240 hiAutomatonCegarLoop]: Abstraction has 784 states and 849 transitions. [2024-11-08 00:19:50,110 INFO L425 stractBuchiCegarLoop]: Abstraction has 784 states and 849 transitions. [2024-11-08 00:19:50,110 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-08 00:19:50,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 784 states and 849 transitions. [2024-11-08 00:19:50,113 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2024-11-08 00:19:50,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:50,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:50,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-08 00:19:50,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 00:19:50,114 INFO L745 eck$LassoCheckResult]: Stem: 13668#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 13669#L-1 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; 13670#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 13671#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 13675#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 13656#L25-3 [2024-11-08 00:19:50,114 INFO L747 eck$LassoCheckResult]: Loop: 13656#L25-3 assume !!(main_~d~0#1 < 6); 13655#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 13656#L25-3 [2024-11-08 00:19:50,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:50,115 INFO L85 PathProgramCache]: Analyzing trace with hash 28698927, now seen corresponding path program 1 times [2024-11-08 00:19:50,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:50,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031709155] [2024-11-08 00:19:50,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:50,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:50,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:50,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 1 times [2024-11-08 00:19:50,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:50,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438946210] [2024-11-08 00:19:50,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:50,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:50,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1809866161, now seen corresponding path program 1 times [2024-11-08 00:19:50,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:50,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924533198] [2024-11-08 00:19:50,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:50,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:50,146 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:50,146 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:50,146 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:50,147 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:50,147 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-08 00:19:50,147 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,147 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:50,147 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:50,147 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration12_Loop [2024-11-08 00:19:50,147 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:50,147 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:50,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:50,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:50,170 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:50,170 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-08 00:19:50,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:50,174 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:50,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-08 00:19:50,177 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:50,177 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:50,191 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:50,191 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-08 00:19:50,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:50,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:50,210 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:50,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-08 00:19:50,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:50,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:50,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-08 00:19:50,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:50,246 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:50,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-08 00:19:50,249 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-08 00:19:50,249 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:50,285 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-08 00:19:50,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-08 00:19:50,291 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:50,291 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:50,291 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:50,291 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:50,291 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 00:19:50,291 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,291 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:50,291 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:50,291 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration12_Loop [2024-11-08 00:19:50,291 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:50,291 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:50,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:50,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:50,314 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:50,315 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 00:19:50,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:50,318 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:50,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-08 00:19:50,321 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-08 00:19:50,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:50,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:50,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:50,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:50,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:50,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:50,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:50,338 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 00:19:50,341 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-08 00:19:50,341 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-08 00:19:50,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:50,344 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:50,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-08 00:19:50,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 00:19:50,360 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-08 00:19:50,360 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 00:19:50,360 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-08 00:19:50,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-08 00:19:50,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-08 00:19:50,385 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-08 00:19:50,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:50,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:50,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:50,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:50,425 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:50,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:50,433 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-08 00:19:50,433 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-08 00:19:50,433 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 784 states and 849 transitions. cyclomatic complexity: 71 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-08 00:19:50,451 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 784 states and 849 transitions. cyclomatic complexity: 71. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 860 states and 933 transitions. Complement of second has 7 states. [2024-11-08 00:19:50,452 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-08 00:19:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-08 00:19:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-08 00:19:50,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-08 00:19:50,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:50,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2024-11-08 00:19:50,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:50,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-08 00:19:50,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:50,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 860 states and 933 transitions. [2024-11-08 00:19:50,460 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2024-11-08 00:19:50,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 860 states to 832 states and 900 transitions. [2024-11-08 00:19:50,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2024-11-08 00:19:50,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2024-11-08 00:19:50,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 832 states and 900 transitions. [2024-11-08 00:19:50,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 00:19:50,466 INFO L218 hiAutomatonCegarLoop]: Abstraction has 832 states and 900 transitions. [2024-11-08 00:19:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states and 900 transitions. [2024-11-08 00:19:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 784. [2024-11-08 00:19:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 784 states have (on average 1.0816326530612246) internal successors, (848), 783 states have internal predecessors, (848), 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-08 00:19:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 848 transitions. [2024-11-08 00:19:50,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 784 states and 848 transitions. [2024-11-08 00:19:50,478 INFO L425 stractBuchiCegarLoop]: Abstraction has 784 states and 848 transitions. [2024-11-08 00:19:50,479 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-08 00:19:50,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 784 states and 848 transitions. [2024-11-08 00:19:50,482 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2024-11-08 00:19:50,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:50,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:50,483 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 00:19:50,483 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 00:19:50,484 INFO L745 eck$LassoCheckResult]: Stem: 15356#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 15357#L-1 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; 15358#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 15359#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 15363#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 15365#L25-3 assume !!(main_~d~0#1 < 6); 16126#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16125#L25-3 assume !!(main_~d~0#1 < 6); 16123#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16121#L25-3 assume !!(main_~d~0#1 < 6); 16119#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16117#L25-3 assume !!(main_~d~0#1 < 6); 16115#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16113#L25-3 assume !!(main_~d~0#1 < 6); 16111#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16109#L25-3 assume !!(main_~d~0#1 < 6); 16106#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16105#L25-3 assume !(main_~d~0#1 < 6); 15954#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 15733#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 15344#L25-3 [2024-11-08 00:19:50,484 INFO L747 eck$LassoCheckResult]: Loop: 15344#L25-3 assume !!(main_~d~0#1 < 6); 15343#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 15344#L25-3 [2024-11-08 00:19:50,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:50,484 INFO L85 PathProgramCache]: Analyzing trace with hash 310397559, now seen corresponding path program 2 times [2024-11-08 00:19:50,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:50,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171284201] [2024-11-08 00:19:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:50,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:50,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:50,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 2 times [2024-11-08 00:19:50,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:50,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060317077] [2024-11-08 00:19:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:50,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1939311865, now seen corresponding path program 3 times [2024-11-08 00:19:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:50,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316046487] [2024-11-08 00:19:50,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:50,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:50,529 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:50,530 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:50,530 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:50,530 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:50,530 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-08 00:19:50,530 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,530 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:50,530 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:50,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration13_Loop [2024-11-08 00:19:50,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:50,530 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:50,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:50,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:50,551 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:50,552 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-08 00:19:50,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:50,555 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:50,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-08 00:19:50,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:50,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:50,575 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:50,575 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-08 00:19:50,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-08 00:19:50,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:50,593 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:50,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-08 00:19:50,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:50,597 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:50,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:50,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:50,626 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:50,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-08 00:19:50,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-08 00:19:50,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:50,656 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-08 00:19:50,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-08 00:19:50,661 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:50,661 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:50,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:50,661 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:50,661 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 00:19:50,661 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,661 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:50,661 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:50,661 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration13_Loop [2024-11-08 00:19:50,663 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:50,663 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:50,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:50,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:50,683 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:50,683 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 00:19:50,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:50,685 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:50,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-08 00:19:50,687 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-08 00:19:50,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:50,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:50,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:50,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:50,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:50,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:50,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:50,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:50,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-08 00:19:50,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:50,712 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:50,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-08 00:19:50,714 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-08 00:19:50,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:50,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:50,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:50,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:50,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:50,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:50,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:50,727 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 00:19:50,729 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-08 00:19:50,729 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-08 00:19:50,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:50,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:50,732 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:50,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-08 00:19:50,734 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 00:19:50,734 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-08 00:19:50,734 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 00:19:50,734 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-08 00:19:50,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-08 00:19:50,747 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-08 00:19:50,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:50,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:50,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:50,794 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:50,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:50,805 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-08 00:19:50,806 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-08 00:19:50,806 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-08 00:19:50,827 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 856 states and 927 transitions. Complement of second has 7 states. [2024-11-08 00:19:50,828 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-08 00:19:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-08 00:19:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-08 00:19:50,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 20 letters. Loop has 2 letters. [2024-11-08 00:19:50,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:50,829 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-08 00:19:50,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:50,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:50,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:50,877 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:50,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:50,888 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-08 00:19:50,888 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-08 00:19:50,889 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-08 00:19:50,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 856 states and 927 transitions. Complement of second has 7 states. [2024-11-08 00:19:50,908 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-08 00:19:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-08 00:19:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-08 00:19:50,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 20 letters. Loop has 2 letters. [2024-11-08 00:19:50,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:50,908 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-08 00:19:50,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:50,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:50,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:50,958 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:50,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:50,969 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-08 00:19:50,970 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-08 00:19:50,970 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-08 00:19:50,994 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 1218 states and 1335 transitions. Complement of second has 6 states. [2024-11-08 00:19:50,994 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-08 00:19:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-08 00:19:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-08 00:19:50,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 20 letters. Loop has 2 letters. [2024-11-08 00:19:50,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:50,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 22 letters. Loop has 2 letters. [2024-11-08 00:19:50,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:50,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 20 letters. Loop has 4 letters. [2024-11-08 00:19:50,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:50,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1218 states and 1335 transitions. [2024-11-08 00:19:51,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2024-11-08 00:19:51,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1218 states to 769 states and 830 transitions. [2024-11-08 00:19:51,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-08 00:19:51,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-08 00:19:51,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 769 states and 830 transitions. [2024-11-08 00:19:51,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 00:19:51,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 769 states and 830 transitions. [2024-11-08 00:19:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states and 830 transitions. [2024-11-08 00:19:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 766. [2024-11-08 00:19:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 766 states have (on average 1.0796344647519582) internal successors, (827), 765 states have internal predecessors, (827), 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-08 00:19:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 827 transitions. [2024-11-08 00:19:51,020 INFO L240 hiAutomatonCegarLoop]: Abstraction has 766 states and 827 transitions. [2024-11-08 00:19:51,020 INFO L425 stractBuchiCegarLoop]: Abstraction has 766 states and 827 transitions. [2024-11-08 00:19:51,020 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-08 00:19:51,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 766 states and 827 transitions. [2024-11-08 00:19:51,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2024-11-08 00:19:51,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:51,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:51,024 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 36, 6, 6, 6, 2, 1, 1, 1, 1, 1] [2024-11-08 00:19:51,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-08 00:19:51,025 INFO L745 eck$LassoCheckResult]: Stem: 19306#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 19307#L-1 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; 19312#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 19308#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 19309#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19689#L25-3 assume !!(main_~d~0#1 < 6); 19687#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19685#L25-3 assume !!(main_~d~0#1 < 6); 19683#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19681#L25-3 assume !!(main_~d~0#1 < 6); 19679#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19677#L25-3 assume !!(main_~d~0#1 < 6); 19676#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19673#L25-3 assume !!(main_~d~0#1 < 6); 19671#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19669#L25-3 assume !!(main_~d~0#1 < 6); 19666#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19665#L25-3 assume !(main_~d~0#1 < 6); 19663#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19661#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19659#L25-3 assume !!(main_~d~0#1 < 6); 19657#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19655#L25-3 assume !!(main_~d~0#1 < 6); 19653#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19651#L25-3 assume !!(main_~d~0#1 < 6); 19649#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19647#L25-3 assume !!(main_~d~0#1 < 6); 19646#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19643#L25-3 assume !!(main_~d~0#1 < 6); 19641#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19639#L25-3 assume !!(main_~d~0#1 < 6); 19636#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19635#L25-3 assume !(main_~d~0#1 < 6); 19633#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19631#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19629#L25-3 assume !!(main_~d~0#1 < 6); 19627#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19625#L25-3 assume !!(main_~d~0#1 < 6); 19623#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19621#L25-3 assume !!(main_~d~0#1 < 6); 19619#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19617#L25-3 assume !!(main_~d~0#1 < 6); 19616#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19613#L25-3 assume !!(main_~d~0#1 < 6); 19611#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19609#L25-3 assume !!(main_~d~0#1 < 6); 19606#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19605#L25-3 assume !(main_~d~0#1 < 6); 19603#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19601#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19599#L25-3 assume !!(main_~d~0#1 < 6); 19597#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19595#L25-3 assume !!(main_~d~0#1 < 6); 19593#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19591#L25-3 assume !!(main_~d~0#1 < 6); 19589#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19587#L25-3 assume !!(main_~d~0#1 < 6); 19586#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19583#L25-3 assume !!(main_~d~0#1 < 6); 19581#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19579#L25-3 assume !!(main_~d~0#1 < 6); 19576#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19575#L25-3 assume !(main_~d~0#1 < 6); 19573#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19571#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19569#L25-3 assume !!(main_~d~0#1 < 6); 19567#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19565#L25-3 assume !!(main_~d~0#1 < 6); 19563#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19561#L25-3 assume !!(main_~d~0#1 < 6); 19559#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19557#L25-3 assume !!(main_~d~0#1 < 6); 19556#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19553#L25-3 assume !!(main_~d~0#1 < 6); 19551#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19549#L25-3 assume !!(main_~d~0#1 < 6); 19547#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19546#L25-3 assume !(main_~d~0#1 < 6); 19544#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19542#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19504#L25-3 assume !!(main_~d~0#1 < 6); 19539#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19537#L25-3 assume !!(main_~d~0#1 < 6); 19535#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19533#L25-3 assume !!(main_~d~0#1 < 6); 19531#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19528#L25-3 assume !!(main_~d~0#1 < 6); 19526#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19522#L25-3 assume !!(main_~d~0#1 < 6); 19519#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19515#L25-3 assume !!(main_~d~0#1 < 6); 19510#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19509#L25-3 assume !(main_~d~0#1 < 6); 19507#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19503#L24-3 assume !(main_~c~0#1 < 6); 19501#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 19497#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 19296#L24-3 [2024-11-08 00:19:51,025 INFO L747 eck$LassoCheckResult]: Loop: 19296#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19303#L25-3 assume !!(main_~d~0#1 < 6); 19304#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19530#L25-3 assume !!(main_~d~0#1 < 6); 19527#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19525#L25-3 assume !!(main_~d~0#1 < 6); 19521#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19518#L25-3 assume !!(main_~d~0#1 < 6); 19514#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19512#L25-3 assume !!(main_~d~0#1 < 6); 19508#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19506#L25-3 assume !!(main_~d~0#1 < 6); 19500#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19499#L25-3 assume !(main_~d~0#1 < 6); 19295#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19296#L24-3 [2024-11-08 00:19:51,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash -901436333, now seen corresponding path program 2 times [2024-11-08 00:19:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:51,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512536981] [2024-11-08 00:19:51,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:51,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:51,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:51,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:51,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1161196429, now seen corresponding path program 2 times [2024-11-08 00:19:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:51,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75272332] [2024-11-08 00:19:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:51,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:51,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:51,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:51,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1529665787, now seen corresponding path program 3 times [2024-11-08 00:19:51,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:51,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771990166] [2024-11-08 00:19:51,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:51,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:51,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:51,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:51,132 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:51,132 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:51,132 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:51,132 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:51,132 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-08 00:19:51,132 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:51,132 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:51,132 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:51,132 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration14_Loop [2024-11-08 00:19:51,133 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:51,133 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:51,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:51,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:51,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:51,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:51,168 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:51,168 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-08 00:19:51,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:51,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:51,171 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:51,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-08 00:19:51,174 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:51,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:51,189 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:51,189 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-08 00:19:51,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:51,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:51,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:51,207 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:51,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-08 00:19:51,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:51,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:51,227 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:51,228 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-08 00:19:51,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:51,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:51,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:51,246 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:51,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-08 00:19:51,249 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:51,249 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:51,262 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:51,262 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-08 00:19:51,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-08 00:19:51,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:51,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:51,276 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:51,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-08 00:19:51,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:51,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:51,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:51,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:51,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:51,302 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:51,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-08 00:19:51,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-08 00:19:51,304 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:51,331 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-08 00:19:51,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-08 00:19:51,335 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:51,336 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:51,336 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:51,336 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:51,336 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 00:19:51,336 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:51,336 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:51,336 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:51,336 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration14_Loop [2024-11-08 00:19:51,336 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:51,336 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:51,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:51,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:51,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:51,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:51,364 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:51,364 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 00:19:51,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:51,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:51,368 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:51,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-08 00:19:51,372 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-08 00:19:51,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:51,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:51,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:51,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:51,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:51,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:51,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:51,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:51,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-08 00:19:51,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:51,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:51,397 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:51,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-08 00:19:51,399 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-08 00:19:51,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:51,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:51,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:51,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:51,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:51,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:51,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:51,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:51,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:51,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:51,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:51,431 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:51,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-08 00:19:51,435 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-08 00:19:51,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:51,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:51,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:51,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:51,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:51,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:51,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:51,452 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 00:19:51,454 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-08 00:19:51,454 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-08 00:19:51,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:51,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:51,457 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:51,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-08 00:19:51,460 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 00:19:51,460 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-08 00:19:51,460 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 00:19:51,460 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-08 00:19:51,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-08 00:19:51,473 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-08 00:19:51,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:51,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:51,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:51,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:51,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 00:19:51,650 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-08 00:19:51,650 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 00:19:51,672 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 1125 states and 1215 transitions. Complement of second has 7 states. [2024-11-08 00:19:51,673 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-08 00:19:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 00:19:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-11-08 00:19:51,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 97 letters. Loop has 15 letters. [2024-11-08 00:19:51,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:51,675 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-08 00:19:51,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:51,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:51,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:51,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:51,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 00:19:51,864 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-08 00:19:51,864 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 00:19:51,882 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 1125 states and 1215 transitions. Complement of second has 7 states. [2024-11-08 00:19:51,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-08 00:19:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 00:19:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-11-08 00:19:51,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 97 letters. Loop has 15 letters. [2024-11-08 00:19:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:51,884 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-08 00:19:51,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:51,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:51,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:52,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:52,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:52,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-08 00:19:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:52,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:52,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 00:19:52,106 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-08 00:19:52,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 00:19:52,127 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 1474 states and 1593 transitions. Complement of second has 6 states. [2024-11-08 00:19:52,128 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-08 00:19:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 00:19:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-08 00:19:52,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 97 letters. Loop has 15 letters. [2024-11-08 00:19:52,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:52,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 112 letters. Loop has 15 letters. [2024-11-08 00:19:52,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:52,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 97 letters. Loop has 30 letters. [2024-11-08 00:19:52,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:52,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 1593 transitions. [2024-11-08 00:19:52,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-11-08 00:19:52,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 658 states and 709 transitions. [2024-11-08 00:19:52,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-08 00:19:52,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-08 00:19:52,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 709 transitions. [2024-11-08 00:19:52,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 00:19:52,143 INFO L218 hiAutomatonCegarLoop]: Abstraction has 658 states and 709 transitions. [2024-11-08 00:19:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 709 transitions. [2024-11-08 00:19:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 657. [2024-11-08 00:19:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 657 states have (on average 1.0776255707762556) internal successors, (708), 656 states have internal predecessors, (708), 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-08 00:19:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 708 transitions. [2024-11-08 00:19:52,152 INFO L240 hiAutomatonCegarLoop]: Abstraction has 657 states and 708 transitions. [2024-11-08 00:19:52,153 INFO L425 stractBuchiCegarLoop]: Abstraction has 657 states and 708 transitions. [2024-11-08 00:19:52,153 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-08 00:19:52,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 657 states and 708 transitions. [2024-11-08 00:19:52,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-11-08 00:19:52,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:19:52,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:19:52,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [216, 216, 36, 36, 36, 6, 6, 6, 2, 1, 1, 1, 1] [2024-11-08 00:19:52,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 6, 6, 6, 1, 1, 1] [2024-11-08 00:19:52,164 INFO L745 eck$LassoCheckResult]: Stem: 24838#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 24839#L-1 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; 24843#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 24841#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 24842#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25475#L25-3 assume !!(main_~d~0#1 < 6); 25474#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25473#L25-3 assume !!(main_~d~0#1 < 6); 25472#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25471#L25-3 assume !!(main_~d~0#1 < 6); 25470#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25469#L25-3 assume !!(main_~d~0#1 < 6); 25468#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25467#L25-3 assume !!(main_~d~0#1 < 6); 25466#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25465#L25-3 assume !!(main_~d~0#1 < 6); 25464#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25463#L25-3 assume !(main_~d~0#1 < 6); 25462#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25461#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25459#L25-3 assume !!(main_~d~0#1 < 6); 25457#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25455#L25-3 assume !!(main_~d~0#1 < 6); 25453#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25451#L25-3 assume !!(main_~d~0#1 < 6); 25449#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25447#L25-3 assume !!(main_~d~0#1 < 6); 25445#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25443#L25-3 assume !!(main_~d~0#1 < 6); 25441#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25439#L25-3 assume !!(main_~d~0#1 < 6); 25436#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25435#L25-3 assume !(main_~d~0#1 < 6); 25433#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25431#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25429#L25-3 assume !!(main_~d~0#1 < 6); 25427#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25425#L25-3 assume !!(main_~d~0#1 < 6); 25423#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25421#L25-3 assume !!(main_~d~0#1 < 6); 25419#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25417#L25-3 assume !!(main_~d~0#1 < 6); 25415#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25413#L25-3 assume !!(main_~d~0#1 < 6); 25411#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25409#L25-3 assume !!(main_~d~0#1 < 6); 25406#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25405#L25-3 assume !(main_~d~0#1 < 6); 25403#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25401#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25399#L25-3 assume !!(main_~d~0#1 < 6); 25397#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25395#L25-3 assume !!(main_~d~0#1 < 6); 25393#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25391#L25-3 assume !!(main_~d~0#1 < 6); 25389#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25387#L25-3 assume !!(main_~d~0#1 < 6); 25385#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25383#L25-3 assume !!(main_~d~0#1 < 6); 25381#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25379#L25-3 assume !!(main_~d~0#1 < 6); 25376#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25375#L25-3 assume !(main_~d~0#1 < 6); 25373#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25371#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25369#L25-3 assume !!(main_~d~0#1 < 6); 25367#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25365#L25-3 assume !!(main_~d~0#1 < 6); 25363#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25361#L25-3 assume !!(main_~d~0#1 < 6); 25359#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25357#L25-3 assume !!(main_~d~0#1 < 6); 25355#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25353#L25-3 assume !!(main_~d~0#1 < 6); 25351#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25349#L25-3 assume !!(main_~d~0#1 < 6); 25346#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25345#L25-3 assume !(main_~d~0#1 < 6); 25343#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25341#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25312#L25-3 assume !!(main_~d~0#1 < 6); 25339#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25337#L25-3 assume !!(main_~d~0#1 < 6); 25335#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25333#L25-3 assume !!(main_~d~0#1 < 6); 25331#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25329#L25-3 assume !!(main_~d~0#1 < 6); 25327#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25325#L25-3 assume !!(main_~d~0#1 < 6); 25323#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25321#L25-3 assume !!(main_~d~0#1 < 6); 25318#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25317#L25-3 assume !(main_~d~0#1 < 6); 25315#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25311#L24-3 assume !(main_~c~0#1 < 6); 24835#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 24836#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 24846#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24837#L25-3 assume !!(main_~d~0#1 < 6); 24829#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24830#L25-3 assume !!(main_~d~0#1 < 6); 25485#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25484#L25-3 assume !!(main_~d~0#1 < 6); 25483#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25482#L25-3 assume !!(main_~d~0#1 < 6); 25481#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25480#L25-3 assume !!(main_~d~0#1 < 6); 25479#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25478#L25-3 assume !!(main_~d~0#1 < 6); 25477#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25476#L25-3 assume !(main_~d~0#1 < 6); 24831#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24832#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25460#L25-3 assume !!(main_~d~0#1 < 6); 25458#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25456#L25-3 assume !!(main_~d~0#1 < 6); 25454#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25452#L25-3 assume !!(main_~d~0#1 < 6); 25450#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25448#L25-3 assume !!(main_~d~0#1 < 6); 25446#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25444#L25-3 assume !!(main_~d~0#1 < 6); 25442#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25440#L25-3 assume !!(main_~d~0#1 < 6); 25438#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25437#L25-3 assume !(main_~d~0#1 < 6); 25434#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25432#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25430#L25-3 assume !!(main_~d~0#1 < 6); 25428#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25426#L25-3 assume !!(main_~d~0#1 < 6); 25424#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25422#L25-3 assume !!(main_~d~0#1 < 6); 25420#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25418#L25-3 assume !!(main_~d~0#1 < 6); 25416#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25414#L25-3 assume !!(main_~d~0#1 < 6); 25412#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25410#L25-3 assume !!(main_~d~0#1 < 6); 25408#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25407#L25-3 assume !(main_~d~0#1 < 6); 25404#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25402#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25400#L25-3 assume !!(main_~d~0#1 < 6); 25398#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25396#L25-3 assume !!(main_~d~0#1 < 6); 25394#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25392#L25-3 assume !!(main_~d~0#1 < 6); 25390#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25388#L25-3 assume !!(main_~d~0#1 < 6); 25386#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25384#L25-3 assume !!(main_~d~0#1 < 6); 25382#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25380#L25-3 assume !!(main_~d~0#1 < 6); 25378#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25377#L25-3 assume !(main_~d~0#1 < 6); 25374#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25372#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25370#L25-3 assume !!(main_~d~0#1 < 6); 25368#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25366#L25-3 assume !!(main_~d~0#1 < 6); 25364#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25362#L25-3 assume !!(main_~d~0#1 < 6); 25360#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25358#L25-3 assume !!(main_~d~0#1 < 6); 25356#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25354#L25-3 assume !!(main_~d~0#1 < 6); 25352#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25350#L25-3 assume !!(main_~d~0#1 < 6); 25348#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25347#L25-3 assume !(main_~d~0#1 < 6); 25344#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25342#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25314#L25-3 assume !!(main_~d~0#1 < 6); 25340#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25338#L25-3 assume !!(main_~d~0#1 < 6); 25336#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25334#L25-3 assume !!(main_~d~0#1 < 6); 25332#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25330#L25-3 assume !!(main_~d~0#1 < 6); 25328#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25326#L25-3 assume !!(main_~d~0#1 < 6); 25324#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25322#L25-3 assume !!(main_~d~0#1 < 6); 25320#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25319#L25-3 assume !(main_~d~0#1 < 6); 25316#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25313#L24-3 assume !(main_~c~0#1 < 6); 25310#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 25309#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 25308#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25307#L25-3 assume !!(main_~d~0#1 < 6); 25306#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25305#L25-3 assume !!(main_~d~0#1 < 6); 25304#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25303#L25-3 assume !!(main_~d~0#1 < 6); 25302#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25301#L25-3 assume !!(main_~d~0#1 < 6); 25300#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25299#L25-3 assume !!(main_~d~0#1 < 6); 25298#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25297#L25-3 assume !!(main_~d~0#1 < 6); 25296#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25295#L25-3 assume !(main_~d~0#1 < 6); 25294#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25293#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25292#L25-3 assume !!(main_~d~0#1 < 6); 25291#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25290#L25-3 assume !!(main_~d~0#1 < 6); 25289#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25288#L25-3 assume !!(main_~d~0#1 < 6); 25287#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25286#L25-3 assume !!(main_~d~0#1 < 6); 25285#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25284#L25-3 assume !!(main_~d~0#1 < 6); 25283#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25282#L25-3 assume !!(main_~d~0#1 < 6); 25281#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25280#L25-3 assume !(main_~d~0#1 < 6); 25279#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25278#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25277#L25-3 assume !!(main_~d~0#1 < 6); 25276#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25275#L25-3 assume !!(main_~d~0#1 < 6); 25274#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25273#L25-3 assume !!(main_~d~0#1 < 6); 25272#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25271#L25-3 assume !!(main_~d~0#1 < 6); 25270#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25269#L25-3 assume !!(main_~d~0#1 < 6); 25268#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25267#L25-3 assume !!(main_~d~0#1 < 6); 25266#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25265#L25-3 assume !(main_~d~0#1 < 6); 25264#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25263#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25262#L25-3 assume !!(main_~d~0#1 < 6); 25261#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25260#L25-3 assume !!(main_~d~0#1 < 6); 25259#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25258#L25-3 assume !!(main_~d~0#1 < 6); 25257#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25256#L25-3 assume !!(main_~d~0#1 < 6); 25255#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25254#L25-3 assume !!(main_~d~0#1 < 6); 25253#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25252#L25-3 assume !!(main_~d~0#1 < 6); 25251#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25250#L25-3 assume !(main_~d~0#1 < 6); 25249#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25248#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25247#L25-3 assume !!(main_~d~0#1 < 6); 25246#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25245#L25-3 assume !!(main_~d~0#1 < 6); 25244#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25243#L25-3 assume !!(main_~d~0#1 < 6); 25242#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25241#L25-3 assume !!(main_~d~0#1 < 6); 25240#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25239#L25-3 assume !!(main_~d~0#1 < 6); 25238#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25237#L25-3 assume !!(main_~d~0#1 < 6); 25236#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25235#L25-3 assume !(main_~d~0#1 < 6); 25234#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25233#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25219#L25-3 assume !!(main_~d~0#1 < 6); 25232#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25231#L25-3 assume !!(main_~d~0#1 < 6); 25230#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25229#L25-3 assume !!(main_~d~0#1 < 6); 25228#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25227#L25-3 assume !!(main_~d~0#1 < 6); 25226#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25225#L25-3 assume !!(main_~d~0#1 < 6); 25224#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25223#L25-3 assume !!(main_~d~0#1 < 6); 25222#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25221#L25-3 assume !(main_~d~0#1 < 6); 25220#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25218#L24-3 assume !(main_~c~0#1 < 6); 25217#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 25216#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 25215#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25214#L25-3 assume !!(main_~d~0#1 < 6); 25213#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25212#L25-3 assume !!(main_~d~0#1 < 6); 25211#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25210#L25-3 assume !!(main_~d~0#1 < 6); 25209#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25208#L25-3 assume !!(main_~d~0#1 < 6); 25207#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25206#L25-3 assume !!(main_~d~0#1 < 6); 25205#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25204#L25-3 assume !!(main_~d~0#1 < 6); 25203#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25202#L25-3 assume !(main_~d~0#1 < 6); 25201#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25200#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25199#L25-3 assume !!(main_~d~0#1 < 6); 25198#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25197#L25-3 assume !!(main_~d~0#1 < 6); 25196#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25195#L25-3 assume !!(main_~d~0#1 < 6); 25194#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25193#L25-3 assume !!(main_~d~0#1 < 6); 25192#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25191#L25-3 assume !!(main_~d~0#1 < 6); 25190#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25189#L25-3 assume !!(main_~d~0#1 < 6); 25188#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25187#L25-3 assume !(main_~d~0#1 < 6); 25186#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25185#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25184#L25-3 assume !!(main_~d~0#1 < 6); 25183#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25182#L25-3 assume !!(main_~d~0#1 < 6); 25181#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25180#L25-3 assume !!(main_~d~0#1 < 6); 25179#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25178#L25-3 assume !!(main_~d~0#1 < 6); 25177#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25176#L25-3 assume !!(main_~d~0#1 < 6); 25175#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25174#L25-3 assume !!(main_~d~0#1 < 6); 25173#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25172#L25-3 assume !(main_~d~0#1 < 6); 25171#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25170#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25169#L25-3 assume !!(main_~d~0#1 < 6); 25168#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25167#L25-3 assume !!(main_~d~0#1 < 6); 25166#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25165#L25-3 assume !!(main_~d~0#1 < 6); 25164#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25163#L25-3 assume !!(main_~d~0#1 < 6); 25162#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25161#L25-3 assume !!(main_~d~0#1 < 6); 25160#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25159#L25-3 assume !!(main_~d~0#1 < 6); 25158#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25157#L25-3 assume !(main_~d~0#1 < 6); 25156#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25155#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25154#L25-3 assume !!(main_~d~0#1 < 6); 25153#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25152#L25-3 assume !!(main_~d~0#1 < 6); 25151#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25150#L25-3 assume !!(main_~d~0#1 < 6); 25149#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25148#L25-3 assume !!(main_~d~0#1 < 6); 25147#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25146#L25-3 assume !!(main_~d~0#1 < 6); 25145#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25144#L25-3 assume !!(main_~d~0#1 < 6); 25143#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25142#L25-3 assume !(main_~d~0#1 < 6); 25141#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25140#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25126#L25-3 assume !!(main_~d~0#1 < 6); 25139#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25138#L25-3 assume !!(main_~d~0#1 < 6); 25137#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25136#L25-3 assume !!(main_~d~0#1 < 6); 25135#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25134#L25-3 assume !!(main_~d~0#1 < 6); 25133#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25132#L25-3 assume !!(main_~d~0#1 < 6); 25131#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25130#L25-3 assume !!(main_~d~0#1 < 6); 25129#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25128#L25-3 assume !(main_~d~0#1 < 6); 25127#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25125#L24-3 assume !(main_~c~0#1 < 6); 25124#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 25123#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 25122#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25121#L25-3 assume !!(main_~d~0#1 < 6); 25120#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25119#L25-3 assume !!(main_~d~0#1 < 6); 25118#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25117#L25-3 assume !!(main_~d~0#1 < 6); 25116#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25115#L25-3 assume !!(main_~d~0#1 < 6); 25114#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25113#L25-3 assume !!(main_~d~0#1 < 6); 25112#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25111#L25-3 assume !!(main_~d~0#1 < 6); 25110#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25109#L25-3 assume !(main_~d~0#1 < 6); 25108#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25107#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25106#L25-3 assume !!(main_~d~0#1 < 6); 25105#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25104#L25-3 assume !!(main_~d~0#1 < 6); 25103#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25102#L25-3 assume !!(main_~d~0#1 < 6); 25101#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25100#L25-3 assume !!(main_~d~0#1 < 6); 25099#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25098#L25-3 assume !!(main_~d~0#1 < 6); 25097#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25096#L25-3 assume !!(main_~d~0#1 < 6); 25095#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25094#L25-3 assume !(main_~d~0#1 < 6); 25093#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25092#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25091#L25-3 assume !!(main_~d~0#1 < 6); 25090#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25089#L25-3 assume !!(main_~d~0#1 < 6); 25088#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25087#L25-3 assume !!(main_~d~0#1 < 6); 25086#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25085#L25-3 assume !!(main_~d~0#1 < 6); 25084#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25083#L25-3 assume !!(main_~d~0#1 < 6); 25082#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25081#L25-3 assume !!(main_~d~0#1 < 6); 25080#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25079#L25-3 assume !(main_~d~0#1 < 6); 25078#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25077#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25076#L25-3 assume !!(main_~d~0#1 < 6); 25075#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25074#L25-3 assume !!(main_~d~0#1 < 6); 25073#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25072#L25-3 assume !!(main_~d~0#1 < 6); 25071#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25070#L25-3 assume !!(main_~d~0#1 < 6); 25069#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25068#L25-3 assume !!(main_~d~0#1 < 6); 25067#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25066#L25-3 assume !!(main_~d~0#1 < 6); 25065#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25064#L25-3 assume !(main_~d~0#1 < 6); 25063#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25062#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25061#L25-3 assume !!(main_~d~0#1 < 6); 25060#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25059#L25-3 assume !!(main_~d~0#1 < 6); 25058#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25057#L25-3 assume !!(main_~d~0#1 < 6); 25056#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25055#L25-3 assume !!(main_~d~0#1 < 6); 25054#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25053#L25-3 assume !!(main_~d~0#1 < 6); 25052#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25051#L25-3 assume !!(main_~d~0#1 < 6); 25050#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25049#L25-3 assume !(main_~d~0#1 < 6); 25048#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25047#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25033#L25-3 assume !!(main_~d~0#1 < 6); 25046#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25045#L25-3 assume !!(main_~d~0#1 < 6); 25044#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25043#L25-3 assume !!(main_~d~0#1 < 6); 25042#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25041#L25-3 assume !!(main_~d~0#1 < 6); 25040#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25039#L25-3 assume !!(main_~d~0#1 < 6); 25038#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25037#L25-3 assume !!(main_~d~0#1 < 6); 25036#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25035#L25-3 assume !(main_~d~0#1 < 6); 25034#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25032#L24-3 assume !(main_~c~0#1 < 6); 25031#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 25030#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 24856#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25029#L25-3 assume !!(main_~d~0#1 < 6); 25028#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25027#L25-3 assume !!(main_~d~0#1 < 6); 25026#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25025#L25-3 assume !!(main_~d~0#1 < 6); 25024#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25023#L25-3 assume !!(main_~d~0#1 < 6); 25022#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25021#L25-3 assume !!(main_~d~0#1 < 6); 25019#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25017#L25-3 assume !!(main_~d~0#1 < 6); 25014#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25013#L25-3 assume !(main_~d~0#1 < 6); 25011#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25009#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25007#L25-3 assume !!(main_~d~0#1 < 6); 25005#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25003#L25-3 assume !!(main_~d~0#1 < 6); 25001#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25000#L25-3 assume !!(main_~d~0#1 < 6); 24997#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24995#L25-3 assume !!(main_~d~0#1 < 6); 24993#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24991#L25-3 assume !!(main_~d~0#1 < 6); 24989#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24987#L25-3 assume !!(main_~d~0#1 < 6); 24984#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24983#L25-3 assume !(main_~d~0#1 < 6); 24981#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24979#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24977#L25-3 assume !!(main_~d~0#1 < 6); 24975#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24973#L25-3 assume !!(main_~d~0#1 < 6); 24971#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24970#L25-3 assume !!(main_~d~0#1 < 6); 24967#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24965#L25-3 assume !!(main_~d~0#1 < 6); 24963#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24961#L25-3 assume !!(main_~d~0#1 < 6); 24959#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24957#L25-3 assume !!(main_~d~0#1 < 6); 24954#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24953#L25-3 assume !(main_~d~0#1 < 6); 24951#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24949#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24947#L25-3 assume !!(main_~d~0#1 < 6); 24945#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24943#L25-3 assume !!(main_~d~0#1 < 6); 24941#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24940#L25-3 assume !!(main_~d~0#1 < 6); 24937#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24935#L25-3 assume !!(main_~d~0#1 < 6); 24933#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24931#L25-3 assume !!(main_~d~0#1 < 6); 24929#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24927#L25-3 assume !!(main_~d~0#1 < 6); 24924#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24923#L25-3 assume !(main_~d~0#1 < 6); 24921#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24919#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24917#L25-3 assume !!(main_~d~0#1 < 6); 24915#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24913#L25-3 assume !!(main_~d~0#1 < 6); 24911#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24910#L25-3 assume !!(main_~d~0#1 < 6); 24907#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24905#L25-3 assume !!(main_~d~0#1 < 6); 24903#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24901#L25-3 assume !!(main_~d~0#1 < 6); 24899#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24897#L25-3 assume !!(main_~d~0#1 < 6); 24894#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24893#L25-3 assume !(main_~d~0#1 < 6); 24891#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24889#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24861#L25-3 assume !!(main_~d~0#1 < 6); 24886#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24884#L25-3 assume !!(main_~d~0#1 < 6); 24882#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24881#L25-3 assume !!(main_~d~0#1 < 6); 24878#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24876#L25-3 assume !!(main_~d~0#1 < 6); 24874#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24873#L25-3 assume !!(main_~d~0#1 < 6); 24871#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24869#L25-3 assume !!(main_~d~0#1 < 6); 24866#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24865#L25-3 assume !(main_~d~0#1 < 6); 24863#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24860#L24-3 assume !(main_~c~0#1 < 6); 24858#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 24855#L23-3 assume !(main_~b~0#1 < 6); 24847#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 24844#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 24834#L23-3 [2024-11-08 00:19:52,164 INFO L747 eck$LassoCheckResult]: Loop: 24834#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 24840#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24845#L25-3 assume !!(main_~d~0#1 < 6); 25020#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25018#L25-3 assume !!(main_~d~0#1 < 6); 25016#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25015#L25-3 assume !!(main_~d~0#1 < 6); 25012#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25010#L25-3 assume !!(main_~d~0#1 < 6); 25008#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25006#L25-3 assume !!(main_~d~0#1 < 6); 25004#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25002#L25-3 assume !!(main_~d~0#1 < 6); 24999#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24998#L25-3 assume !(main_~d~0#1 < 6); 24996#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24994#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24992#L25-3 assume !!(main_~d~0#1 < 6); 24990#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24988#L25-3 assume !!(main_~d~0#1 < 6); 24986#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24985#L25-3 assume !!(main_~d~0#1 < 6); 24982#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24980#L25-3 assume !!(main_~d~0#1 < 6); 24978#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24976#L25-3 assume !!(main_~d~0#1 < 6); 24974#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24972#L25-3 assume !!(main_~d~0#1 < 6); 24969#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24968#L25-3 assume !(main_~d~0#1 < 6); 24966#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24964#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24962#L25-3 assume !!(main_~d~0#1 < 6); 24960#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24958#L25-3 assume !!(main_~d~0#1 < 6); 24956#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24955#L25-3 assume !!(main_~d~0#1 < 6); 24952#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24950#L25-3 assume !!(main_~d~0#1 < 6); 24948#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24946#L25-3 assume !!(main_~d~0#1 < 6); 24944#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24942#L25-3 assume !!(main_~d~0#1 < 6); 24939#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24938#L25-3 assume !(main_~d~0#1 < 6); 24936#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24934#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24932#L25-3 assume !!(main_~d~0#1 < 6); 24930#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24928#L25-3 assume !!(main_~d~0#1 < 6); 24926#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24925#L25-3 assume !!(main_~d~0#1 < 6); 24922#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24920#L25-3 assume !!(main_~d~0#1 < 6); 24918#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24916#L25-3 assume !!(main_~d~0#1 < 6); 24914#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24912#L25-3 assume !!(main_~d~0#1 < 6); 24909#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24908#L25-3 assume !(main_~d~0#1 < 6); 24906#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24904#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24902#L25-3 assume !!(main_~d~0#1 < 6); 24900#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24898#L25-3 assume !!(main_~d~0#1 < 6); 24896#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24895#L25-3 assume !!(main_~d~0#1 < 6); 24892#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24890#L25-3 assume !!(main_~d~0#1 < 6); 24888#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24887#L25-3 assume !!(main_~d~0#1 < 6); 24885#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24883#L25-3 assume !!(main_~d~0#1 < 6); 24880#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24879#L25-3 assume !(main_~d~0#1 < 6); 24877#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24875#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24849#L25-3 assume !!(main_~d~0#1 < 6); 24872#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24870#L25-3 assume !!(main_~d~0#1 < 6); 24868#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24867#L25-3 assume !!(main_~d~0#1 < 6); 24864#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24862#L25-3 assume !!(main_~d~0#1 < 6); 24859#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24857#L25-3 assume !!(main_~d~0#1 < 6); 24854#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24853#L25-3 assume !!(main_~d~0#1 < 6); 24852#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24851#L25-3 assume !(main_~d~0#1 < 6); 24850#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24848#L24-3 assume !(main_~c~0#1 < 6); 24833#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 24834#L23-3 [2024-11-08 00:19:52,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:52,165 INFO L85 PathProgramCache]: Analyzing trace with hash -749072669, now seen corresponding path program 2 times [2024-11-08 00:19:52,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:52,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278890773] [2024-11-08 00:19:52,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:52,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:52,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:52,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash -298958203, now seen corresponding path program 2 times [2024-11-08 00:19:52,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:52,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144910348] [2024-11-08 00:19:52,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:52,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:52,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:52,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:52,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash 194283235, now seen corresponding path program 3 times [2024-11-08 00:19:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:19:52,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602209848] [2024-11-08 00:19:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:19:52,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:19:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:52,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:19:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:19:52,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:19:53,285 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:53,286 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:53,286 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:53,286 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:53,286 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-08 00:19:53,286 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:53,286 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:53,286 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:53,286 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration15_Loop [2024-11-08 00:19:53,286 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:53,286 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:53,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,330 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:53,330 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-08 00:19:53,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:53,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:53,332 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:53,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-08 00:19:53,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:53,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:53,346 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:53,346 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-08 00:19:53,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-08 00:19:53,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:53,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:53,359 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:53,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-08 00:19:53,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:53,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:53,372 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-08 00:19:53,372 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-08 00:19:53,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-08 00:19:53,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:53,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:53,385 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:53,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-08 00:19:53,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-08 00:19:53,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:53,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-08 00:19:53,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:53,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:53,412 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:53,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-08 00:19:53,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-08 00:19:53,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-08 00:19:53,443 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-08 00:19:53,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-08 00:19:53,447 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 00:19:53,447 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 00:19:53,447 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 00:19:53,447 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 00:19:53,447 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 00:19:53,447 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:53,447 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 00:19:53,447 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 00:19:53,448 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration15_Loop [2024-11-08 00:19:53,448 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 00:19:53,448 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 00:19:53,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 00:19:53,492 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 00:19:53,492 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 00:19:53,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:53,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:53,496 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:53,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-08 00:19:53,497 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-08 00:19:53,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:53,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:53,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:53,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:53,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:53,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:53,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:53,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 00:19:53,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-08 00:19:53,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:53,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:53,523 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:53,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-08 00:19:53,525 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-08 00:19:53,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 00:19:53,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 00:19:53,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 00:19:53,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 00:19:53,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 00:19:53,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 00:19:53,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 00:19:53,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 00:19:53,539 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-08 00:19:53,540 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-08 00:19:53,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:19:53,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:19:53,542 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:19:53,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-08 00:19:53,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 00:19:53,543 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-08 00:19:53,543 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 00:19:53,543 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-08 00:19:53,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-08 00:19:53,555 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-08 00:19:53,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:53,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:53,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:54,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:54,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-11-08 00:19:54,632 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-08 00:19:54,632 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-08 00:19:54,664 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) Result 1772 states and 1910 transitions. Complement of second has 7 states. [2024-11-08 00:19:54,664 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-08 00:19:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-08 00:19:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-08 00:19:54,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 564 letters. Loop has 93 letters. [2024-11-08 00:19:54,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:54,665 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-08 00:19:54,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:54,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:54,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:55,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:55,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:55,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-11-08 00:19:55,591 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-08 00:19:55,591 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-08 00:19:55,612 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) Result 1772 states and 1910 transitions. Complement of second has 7 states. [2024-11-08 00:19:55,613 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-08 00:19:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-08 00:19:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-08 00:19:55,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 564 letters. Loop has 93 letters. [2024-11-08 00:19:55,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:55,616 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-08 00:19:55,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:19:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:55,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 00:19:55,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:19:56,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 00:19:56,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:19:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-11-08 00:19:56,507 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-08 00:19:56,507 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-08 00:19:56,524 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) Result 1304 states and 1406 transitions. Complement of second has 6 states. [2024-11-08 00:19:56,525 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-08 00:19:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-08 00:19:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-08 00:19:56,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 564 letters. Loop has 93 letters. [2024-11-08 00:19:56,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:56,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 657 letters. Loop has 93 letters. [2024-11-08 00:19:56,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:56,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 564 letters. Loop has 186 letters. [2024-11-08 00:19:56,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 00:19:56,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1304 states and 1406 transitions. [2024-11-08 00:19:56,555 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-08 00:19:56,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1304 states to 0 states and 0 transitions. [2024-11-08 00:19:56,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-08 00:19:56,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-08 00:19:56,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-08 00:19:56,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:19:56,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 00:19:56,556 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 00:19:56,556 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 00:19:56,557 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-08 00:19:56,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-08 00:19:56,557 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-08 00:19:56,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-08 00:19:56,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.11 12:19:56 BoogieIcfgContainer [2024-11-08 00:19:56,567 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-08 00:19:56,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 00:19:56,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 00:19:56,568 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 00:19:56,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:19:22" (3/4) ... [2024-11-08 00:19:56,570 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 00:19:56,571 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 00:19:56,572 INFO L158 Benchmark]: Toolchain (without parser) took 34741.88ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 92.4MB in the beginning and 318.2MB in the end (delta: -225.8MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-11-08 00:19:56,575 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 00:19:56,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.55ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 81.8MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 00:19:56,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.33ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 00:19:56,575 INFO L158 Benchmark]: Boogie Preprocessor took 45.79ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 00:19:56,575 INFO L158 Benchmark]: RCFGBuilder took 238.91ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 70.4MB in the end (delta: 9.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 00:19:56,576 INFO L158 Benchmark]: BuchiAutomizer took 34218.19ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 70.2MB in the beginning and 318.3MB in the end (delta: -248.2MB). Peak memory consumption was 219.9kB. Max. memory is 16.1GB. [2024-11-08 00:19:56,576 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 369.1MB. Free memory was 318.3MB in the beginning and 318.2MB in the end (delta: 138.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 00:19:56,577 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.96ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.55ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 81.8MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.33ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.79ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 238.91ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 70.4MB in the end (delta: 9.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 34218.19ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 70.2MB in the beginning and 318.3MB in the end (delta: -248.2MB). Peak memory consumption was 219.9kB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 369.1MB. Free memory was 318.3MB in the beginning and 318.2MB in the end (delta: 138.5kB). 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 15 terminating modules (8 trivial, 4 deterministic, 3 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * a) + 11) and consists of 3 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 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * d) + 11) and consists of 4 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. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.1s and 16 iterations. TraceHistogramMax:216. Analysis of lassos took 26.5s. Construction of modules took 0.2s. Büchi inclusion checks took 7.0s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 6. Automata minimization 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1376 StatesRemovedByMinimization, 10 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: 59499/59499 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 485 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 239 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 246 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI8 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: 30ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-08 00:19:56,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:56,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 00:19:57,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 00:19:57,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 00:19:57,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 00:19:57,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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