./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/nested9.i --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-invgen/nested9.i', '-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', 'f3ca1fd1ad8fdbcd9efe7b99bc6e3715231417d253ce4ee9bba3d5969472333a']
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-invgen/nested9.i -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 f3ca1fd1ad8fdbcd9efe7b99bc6e3715231417d253ce4ee9bba3d5969472333a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-08 00:18:19,242 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 00:18:19,326 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:18:19,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 00:18:19,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 00:18:19,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 00:18:19,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 00:18:19,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 00:18:19,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 00:18:19,353 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 00:18:19,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 00:18:19,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 00:18:19,354 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 00:18:19,354 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-08 00:18:19,354 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2024-11-08 00:18:19,354 INFO L153 SettingsManager]: * Use old map elimination=false
[2024-11-08 00:18:19,354 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false
[2024-11-08 00:18:19,354 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true
[2024-11-08 00:18:19,354 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-08 00:18:19,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 00:18:19,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2024-11-08 00:18:19,355 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 00:18:19,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 00:18:19,355 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 00:18:19,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 00:18:19,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2024-11-08 00:18:19,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-08 00:18:19,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2024-11-08 00:18:19,355 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 00:18:19,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-08 00:18:19,356 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 00:18:19,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 00:18:19,356 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false
[2024-11-08 00:18:19,356 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 00:18:19,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 00:18:19,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 00:18:19,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 00:18:19,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 00:18:19,357 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-08 00:18:19,357 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 -> f3ca1fd1ad8fdbcd9efe7b99bc6e3715231417d253ce4ee9bba3d5969472333a
[2024-11-08 00:18:19,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 00:18:19,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 00:18:19,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 00:18:19,642 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 00:18:19,642 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 00:18:19,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/nested9.i
[2024-11-08 00:18:21,052 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 00:18:21,349 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 00:18:21,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested9.i
[2024-11-08 00:18:21,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f7b02201b/7cdbb6d830e644bc924fb7a46ba8f360/FLAG10dc61e08
[2024-11-08 00:18:21,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f7b02201b/7cdbb6d830e644bc924fb7a46ba8f360
[2024-11-08 00:18:21,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 00:18:21,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 00:18:21,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 00:18:21,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 00:18:21,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 00:18:21,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6b85b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21, skipping insertion in model container
[2024-11-08 00:18:21,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,454 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 00:18:21,722 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 00:18:21,749 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 00:18:21,762 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 00:18:21,775 INFO L204 MainTranslator]: Completed translation
[2024-11-08 00:18:21,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21 WrapperNode
[2024-11-08 00:18:21,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 00:18:21,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 00:18:21,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 00:18:21,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 00:18:21,782 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:18:21" (1/1) ...
[2024-11-08 00:18:21,788 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:18:21" (1/1) ...
[2024-11-08 00:18:21,801 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71
[2024-11-08 00:18:21,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 00:18:21,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 00:18:21,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 00:18:21,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 00:18:21,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,819 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:18:21,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 00:18:21,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 00:18:21,839 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 00:18:21,839 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 00:18:21,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21" (1/1) ...
[2024-11-08 00:18:21,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:21,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:21,884 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:18:21,894 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:18:21,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 00:18:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 00:18:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 00:18:21,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 00:18:21,986 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 00:18:21,988 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 00:18:22,152 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live.
[2024-11-08 00:18:22,153 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 00:18:22,160 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 00:18:22,161 INFO L316 CfgBuilder]: Removed 3 assume(true) statements.
[2024-11-08 00:18:22,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:18:22 BoogieIcfgContainer
[2024-11-08 00:18:22,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 00:18:22,162 INFO L112 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-08 00:18:22,162 INFO L270 PluginConnector]: Initializing BuchiAutomizer...
[2024-11-08 00:18:22,167 INFO L274 PluginConnector]: BuchiAutomizer initialized
[2024-11-08 00:18:22,168 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 00:18:22,168 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 12:18:21" (1/3) ...
[2024-11-08 00:18:22,169 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@119d0a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:18:22, skipping insertion in model container
[2024-11-08 00:18:22,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 00:18:22,169 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:18:21" (2/3) ...
[2024-11-08 00:18:22,169 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@119d0a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:18:22, skipping insertion in model container
[2024-11-08 00:18:22,170 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 00:18:22,170 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:18:22" (3/3) ...
[2024-11-08 00:18:22,171 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested9.i
[2024-11-08 00:18:22,221 INFO L300 stractBuchiCegarLoop]: Interprodecural is true
[2024-11-08 00:18:22,221 INFO L301 stractBuchiCegarLoop]: Hoare is None
[2024-11-08 00:18:22,221 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-08 00:18:22,221 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-08 00:18:22,221 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-08 00:18:22,222 INFO L305 stractBuchiCegarLoop]: Difference is false
[2024-11-08 00:18:22,222 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-08 00:18:22,222 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-08 00:18:22,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 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:18:22,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11
[2024-11-08 00:18:22,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:22,243 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:22,247 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:22,247 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 00:18:22,247 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-08 00:18:22,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 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:18:22,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11
[2024-11-08 00:18:22,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:22,251 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:22,251 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:22,251 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 00:18:22,259 INFO L745 eck$LassoCheckResult]: Stem: 17#$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(9, 2);~__BLAST_NONDET~0 := 0; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4#L30true assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 7#L31true assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 9#L32true assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 6#L33true assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 5#L33-1true main_~i~0#1 := 0; 22#L34-3true
[2024-11-08 00:18:22,260 INFO L747 eck$LassoCheckResult]: Loop: 22#L34-3true assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 12#L35-3true assume !(main_~j~0#1 < 3 * main_~i~0#1); 11#L34-2true main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 22#L34-3true
[2024-11-08 00:18:22,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907757, now seen corresponding path program 1 times
[2024-11-08 00:18:22,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:22,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551864227]
[2024-11-08 00:18:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:22,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:22,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:22,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:22,370 INFO L85 PathProgramCache]: Analyzing trace with hash 61796, now seen corresponding path program 1 times
[2024-11-08 00:18:22,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:22,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772523351]
[2024-11-08 00:18:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:22,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:22,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:22,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:22,391 INFO L85 PathProgramCache]: Analyzing trace with hash 763900024, now seen corresponding path program 1 times
[2024-11-08 00:18:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:22,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559614056]
[2024-11-08 00:18:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:22,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:22,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:22,486 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:22,491 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:22,491 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:22,491 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:22,491 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:18:22,491 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:22,491 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:22,491 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:22,492 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration1_Loop
[2024-11-08 00:18:22,492 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:22,492 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:22,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:22,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:22,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:22,597 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:22,598 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:18:22,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:22,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:22,601 INFO L229 MonitoredProcess]: Starting monitored process 2 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:18:22,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2024-11-08 00:18:22,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:22,604 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:22,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0
[2024-11-08 00:18:22,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:22,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:22,638 INFO L229 MonitoredProcess]: Starting monitored process 3 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:18:22,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2024-11-08 00:18:22,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:18:22,640 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:22,678 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:18:22,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0
[2024-11-08 00:18:22,685 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:22,685 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:22,685 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:22,685 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:22,685 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:18:22,685 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:22,685 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:22,685 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:22,685 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration1_Loop
[2024-11-08 00:18:22,685 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:22,685 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:22,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:22,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:22,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:22,726 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:22,729 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:18:22,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:22,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:22,733 INFO L229 MonitoredProcess]: Starting monitored process 4 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:18:22,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2024-11-08 00:18:22,739 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:18:22,752 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:22,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:22,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:22,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:22,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:22,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:22,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:22,762 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:18:22,767 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:18:22,773 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:18:22,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:22,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:22,777 INFO L229 MonitoredProcess]: Starting monitored process 5 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:18:22,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2024-11-08 00:18:22,780 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:18:22,780 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:18:22,781 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:18:22,781 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1
Supporting invariants []
[2024-11-08 00:18:22,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:22,801 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:18:22,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:22,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:22,839 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:22,857 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:22,858 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:22,938 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:18:22,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2024-11-08 00:18:22,960 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates
[2024-11-08 00:18:22,962 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 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 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:23,045 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 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 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 72 states and 105 transitions. Complement of second has 10 states.
[2024-11-08 00:18:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions.
[2024-11-08 00:18:23,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 7 letters. Loop has 3 letters.
[2024-11-08 00:18:23,060 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:23,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 10 letters. Loop has 3 letters.
[2024-11-08 00:18:23,060 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:23,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 7 letters. Loop has 6 letters.
[2024-11-08 00:18:23,060 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:23,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 105 transitions.
[2024-11-08 00:18:23,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14
[2024-11-08 00:18:23,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 39 states and 48 transitions.
[2024-11-08 00:18:23,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22
[2024-11-08 00:18:23,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23
[2024-11-08 00:18:23,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions.
[2024-11-08 00:18:23,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:23,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions.
[2024-11-08 00:18:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions.
[2024-11-08 00:18:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28.
[2024-11-08 00:18:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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:18:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions.
[2024-11-08 00:18:23,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions.
[2024-11-08 00:18:23,093 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions.
[2024-11-08 00:18:23,093 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-08 00:18:23,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions.
[2024-11-08 00:18:23,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9
[2024-11-08 00:18:23,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:23,095 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:23,095 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:23,096 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:23,096 INFO L745 eck$LassoCheckResult]: Stem: 178#$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(9, 2);~__BLAST_NONDET~0 := 0; 167#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 155#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 156#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 160#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 159#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 157#L33-1 main_~i~0#1 := 0; 158#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 172#L35-3
[2024-11-08 00:18:23,096 INFO L747 eck$LassoCheckResult]: Loop: 172#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 161#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 163#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 179#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 168#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 169#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 172#L35-3
[2024-11-08 00:18:23,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash 179565651, now seen corresponding path program 1 times
[2024-11-08 00:18:23,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:23,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304299489]
[2024-11-08 00:18:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:23,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:23,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:23,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:23,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:23,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2077305723, now seen corresponding path program 1 times
[2024-11-08 00:18:23,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:23,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657173659]
[2024-11-08 00:18:23,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:23,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:23,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:23,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:23,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:23,154 INFO L85 PathProgramCache]: Analyzing trace with hash -696444339, now seen corresponding path program 1 times
[2024-11-08 00:18:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:23,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487020022]
[2024-11-08 00:18:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:23,242 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:18:23,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:23,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487020022]
[2024-11-08 00:18:23,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487020022] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 00:18:23,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 00:18:23,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 00:18:23,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137450427]
[2024-11-08 00:18:23,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 00:18:23,294 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:23,294 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:23,294 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:23,294 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:23,294 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:18:23,294 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:23,295 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:23,295 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:23,295 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration2_Loop
[2024-11-08 00:18:23,295 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:23,295 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:23,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:23,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:23,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:23,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:23,354 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:23,355 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:18:23,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:23,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:23,357 INFO L229 MonitoredProcess]: Starting monitored process 6 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:18:23,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2024-11-08 00:18:23,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:23,360 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:23,377 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:23,377 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:23,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0
[2024-11-08 00:18:23,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:23,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:23,393 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:18:23,394 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:18:23,396 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:23,396 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:23,410 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:23,411 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:23,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:23,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:23,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:23,427 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:18:23,434 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:18:23,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:23,435 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:23,463 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:18:23,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:23,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:23,465 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:18:23,470 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:18:23,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:18:23,471 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:23,646 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:18:23,653 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:18:23,653 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:23,653 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:23,653 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:23,653 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:23,654 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:18:23,654 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:23,654 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:23,654 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:23,654 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration2_Loop
[2024-11-08 00:18:23,654 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:23,654 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:23,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:23,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:23,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:23,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:23,712 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:23,712 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:18:23,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:23,716 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:18:23,722 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:18:23,723 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:18:23,746 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:23,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:23,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:23,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:23,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:23,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:23,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:23,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:23,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:23,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:23,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:23,775 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:18:23,777 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:18:23,778 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:18:23,790 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:23,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:23,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:23,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:23,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:23,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:23,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:23,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:23,829 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:18:23,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:23,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:23,832 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:18:23,834 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:18:23,835 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:18:23,847 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:23,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:23,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:23,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:23,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:23,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:23,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:23,852 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:18:23,855 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:18:23,855 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:18:23,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:23,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:23,858 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:18:23,859 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:18:23,860 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:18:23,860 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:18:23,860 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:18:23,860 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~j~0#1) = -4*ULTIMATE.start_main_~j~0#1 + 7
Supporting invariants []
[2024-11-08 00:18:23,873 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:18:23,875 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:18:23,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:23,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:23,899 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:23,915 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:23,915 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:24,014 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates
[2024-11-08 00:18:24,014 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:18:24,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:24,204 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 124 states and 156 transitions. Complement of second has 17 states.
[2024-11-08 00:18:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:18:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions.
[2024-11-08 00:18:24,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 8 letters. Loop has 6 letters.
[2024-11-08 00:18:24,205 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:24,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 14 letters. Loop has 6 letters.
[2024-11-08 00:18:24,206 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:24,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 8 letters. Loop has 12 letters.
[2024-11-08 00:18:24,206 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:24,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 156 transitions.
[2024-11-08 00:18:24,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30
[2024-11-08 00:18:24,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 120 states and 152 transitions.
[2024-11-08 00:18:24,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39
[2024-11-08 00:18:24,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40
[2024-11-08 00:18:24,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 152 transitions.
[2024-11-08 00:18:24,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:24,210 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 152 transitions.
[2024-11-08 00:18:24,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 152 transitions.
[2024-11-08 00:18:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 71.
[2024-11-08 00:18:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.323943661971831) internal successors, (94), 70 states have internal predecessors, (94), 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:18:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions.
[2024-11-08 00:18:24,215 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 94 transitions.
[2024-11-08 00:18:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 00:18:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 00:18:24,217 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:24,234 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions.
[2024-11-08 00:18:24,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions.
[2024-11-08 00:18:24,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9
[2024-11-08 00:18:24,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 36 transitions.
[2024-11-08 00:18:24,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17
[2024-11-08 00:18:24,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17
[2024-11-08 00:18:24,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions.
[2024-11-08 00:18:24,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:24,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 36 transitions.
[2024-11-08 00:18:24,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions.
[2024-11-08 00:18:24,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29.
[2024-11-08 00:18:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 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:18:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions.
[2024-11-08 00:18:24,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions.
[2024-11-08 00:18:24,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 00:18:24,239 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions.
[2024-11-08 00:18:24,239 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-08 00:18:24,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions.
[2024-11-08 00:18:24,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9
[2024-11-08 00:18:24,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:24,240 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:24,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:24,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:24,241 INFO L745 eck$LassoCheckResult]: Stem: 521#$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(9, 2);~__BLAST_NONDET~0 := 0; 503#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 497#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 498#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 502#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 501#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 499#L33-1 main_~i~0#1 := 0; 500#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 515#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 516#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 525#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 514#L35-3
[2024-11-08 00:18:24,241 INFO L747 eck$LassoCheckResult]: Loop: 514#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 504#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 506#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 522#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 510#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 511#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 514#L35-3
[2024-11-08 00:18:24,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:24,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903000, now seen corresponding path program 2 times
[2024-11-08 00:18:24,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:24,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262931310]
[2024-11-08 00:18:24,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:24,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:24,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:24,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:24,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2077305723, now seen corresponding path program 2 times
[2024-11-08 00:18:24,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:24,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105687852]
[2024-11-08 00:18:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:24,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:24,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:24,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash -685690654, now seen corresponding path program 2 times
[2024-11-08 00:18:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:24,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199714423]
[2024-11-08 00:18:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-08 00:18:24,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199714423]
[2024-11-08 00:18:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199714423] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 00:18:24,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 00:18:24,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 00:18:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965189314]
[2024-11-08 00:18:24,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 00:18:24,347 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:24,347 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:24,347 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:24,347 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:24,348 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:18:24,348 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:24,348 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:24,348 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:24,348 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration3_Loop
[2024-11-08 00:18:24,348 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:24,348 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:24,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:24,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:24,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:24,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:24,402 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:24,402 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:18:24,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:24,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:24,405 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:18:24,406 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:18:24,407 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:24,407 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:24,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:24,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:24,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:24,437 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:18:24,438 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:18:24,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:18:24,439 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:24,611 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:18:24,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:24,618 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:24,618 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:24,618 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:24,618 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:24,618 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:18:24,618 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:24,618 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:24,618 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:24,618 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration3_Loop
[2024-11-08 00:18:24,618 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:24,618 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:24,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:24,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:24,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:24,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:24,692 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:24,693 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:18:24,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:24,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:24,695 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:18:24,696 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:18:24,698 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:18:24,710 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:24,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:24,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:24,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:24,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:24,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:24,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:24,714 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:18:24,719 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver.
[2024-11-08 00:18:24,720 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero.
[2024-11-08 00:18:24,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:24,724 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:18:24,731 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:18:24,731 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:18:24,732 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:18:24,732 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:18:24,732 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 3
Supporting invariants []
[2024-11-08 00:18:24,745 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:18:24,746 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:18:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:24,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:24,768 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:24,784 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:24,785 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:24,868 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates
[2024-11-08 00:18:24,868 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:18:24,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 29 states and 35 transitions. Complement of second has 3 states.
[2024-11-08 00:18:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:18:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions.
[2024-11-08 00:18:24,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 6 letters.
[2024-11-08 00:18:24,875 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:24,875 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:18:24,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:24,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:24,892 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:24,908 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:24,909 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:24,990 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates
[2024-11-08 00:18:24,991 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:18:24,995 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 29 states and 35 transitions. Complement of second has 3 states.
[2024-11-08 00:18:24,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:18:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions.
[2024-11-08 00:18:24,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 6 letters.
[2024-11-08 00:18:24,997 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:24,997 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:18:25,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:25,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:25,015 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:25,032 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:25,032 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:25,116 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:18:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:25,145 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 6 loop predicates
[2024-11-08 00:18:25,145 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:18:25,267 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 111 states and 137 transitions. Complement of second has 16 states.
[2024-11-08 00:18:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:18:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions.
[2024-11-08 00:18:25,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 11 letters. Loop has 6 letters.
[2024-11-08 00:18:25,269 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:25,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 17 letters. Loop has 6 letters.
[2024-11-08 00:18:25,269 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:25,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 11 letters. Loop has 12 letters.
[2024-11-08 00:18:25,269 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:25,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 137 transitions.
[2024-11-08 00:18:25,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49
[2024-11-08 00:18:25,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 107 states and 133 transitions.
[2024-11-08 00:18:25,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32
[2024-11-08 00:18:25,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33
[2024-11-08 00:18:25,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 133 transitions.
[2024-11-08 00:18:25,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:25,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 133 transitions.
[2024-11-08 00:18:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 133 transitions.
[2024-11-08 00:18:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 56.
[2024-11-08 00:18:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions.
[2024-11-08 00:18:25,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 73 transitions.
[2024-11-08 00:18:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 00:18:25,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 00:18:25,275 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:18:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:25,295 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions.
[2024-11-08 00:18:25,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions.
[2024-11-08 00:18:25,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10
[2024-11-08 00:18:25,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 31 states and 37 transitions.
[2024-11-08 00:18:25,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2024-11-08 00:18:25,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2024-11-08 00:18:25,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions.
[2024-11-08 00:18:25,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:25,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions.
[2024-11-08 00:18:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions.
[2024-11-08 00:18:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2024-11-08 00:18:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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:18:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions.
[2024-11-08 00:18:25,298 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions.
[2024-11-08 00:18:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 00:18:25,299 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions.
[2024-11-08 00:18:25,299 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-08 00:18:25,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions.
[2024-11-08 00:18:25,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10
[2024-11-08 00:18:25,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:25,300 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:25,300 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:25,300 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:25,300 INFO L745 eck$LassoCheckResult]: Stem: 1032#$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(9, 2);~__BLAST_NONDET~0 := 0; 1014#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 1008#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 1009#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 1013#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 1012#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 1010#L33-1 main_~i~0#1 := 0; 1011#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1024#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1025#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1038#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1023#L35-3
[2024-11-08 00:18:25,301 INFO L747 eck$LassoCheckResult]: Loop: 1023#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 1015#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1016#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1030#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1026#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1027#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 1033#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1034#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1019#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1020#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1023#L35-3
[2024-11-08 00:18:25,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:25,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903000, now seen corresponding path program 3 times
[2024-11-08 00:18:25,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:25,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124196995]
[2024-11-08 00:18:25,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:25,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:25,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:25,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:25,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:25,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1724980661, now seen corresponding path program 1 times
[2024-11-08 00:18:25,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:25,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925866423]
[2024-11-08 00:18:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:25,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:25,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:25,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash 413129778, now seen corresponding path program 1 times
[2024-11-08 00:18:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725959541]
[2024-11-08 00:18:25,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:25,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:25,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:25,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:25,418 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:25,419 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:25,419 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:25,419 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:25,419 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:18:25,419 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:25,419 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:25,419 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:25,419 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration4_Loop
[2024-11-08 00:18:25,419 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:25,419 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:25,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,479 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:25,479 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:18:25,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:25,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:25,481 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:18:25,482 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:18:25,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:25,485 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:25,499 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:25,499 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:25,512 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:18:25,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:25,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:25,515 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:18:25,516 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:18:25,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:25,517 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:25,531 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:25,531 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:25,544 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:18:25,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:25,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:25,547 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:18:25,548 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:18:25,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:25,549 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:25,563 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:25,564 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:25,576 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:18:25,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:25,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:25,578 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:18:25,580 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:18:25,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:25,581 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:25,594 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:25,594 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:25,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0
[2024-11-08 00:18:25,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:25,610 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:18:25,616 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:18:25,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:25,616 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:25,631 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:25,632 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:25,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:25,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:25,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:25,649 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:18:25,653 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:18:25,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:25,654 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:25,685 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:18:25,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:25,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:25,691 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:18:25,706 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:18:25,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:18:25,707 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:25,925 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:18:25,931 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:18:25,932 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:25,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:25,932 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:25,932 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:25,932 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:18:25,932 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:25,932 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:25,932 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:25,932 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration4_Loop
[2024-11-08 00:18:25,932 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:25,932 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:25,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:25,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:26,003 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:26,005 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:18:26,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:26,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:26,008 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:18:26,009 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:18:26,010 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:18:26,022 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:26,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:26,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:26,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:26,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:26,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:26,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:26,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:26,039 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:18:26,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:26,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:26,041 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:18:26,044 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:18:26,045 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:18:26,057 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:26,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:26,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:26,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:26,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:26,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:26,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:26,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:26,074 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:18:26,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:26,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:26,077 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:18:26,078 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:18:26,079 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:18:26,092 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:26,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:26,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:26,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:26,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:26,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:26,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:26,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:26,108 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:18:26,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:26,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:26,110 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:18:26,111 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:18:26,114 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:18:26,126 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:26,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:26,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:26,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:26,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:26,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:26,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:26,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:26,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:26,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:26,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:26,145 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:18:26,146 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:18:26,147 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:18:26,159 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:26,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:26,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:26,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:26,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:26,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:26,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:26,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:26,175 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:18:26,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:26,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:26,178 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:18:26,180 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:18:26,182 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:18:26,193 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:26,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:26,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:26,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:26,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:26,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:26,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:26,199 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:18:26,202 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:18:26,202 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:18:26,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:26,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:26,204 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:18:26,206 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:18:26,207 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:18:26,207 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:18:26,207 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:18:26,207 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~j~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 3
Supporting invariants []
[2024-11-08 00:18:26,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:26,221 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:18:26,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:26,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:26,245 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:26,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:26,268 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:26,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:26,427 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates
[2024-11-08 00:18:26,427 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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:18:26,437 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 37 transitions. Complement of second has 3 states.
[2024-11-08 00:18:26,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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:18:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions.
[2024-11-08 00:18:26,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 10 letters.
[2024-11-08 00:18:26,439 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:26,439 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:18:26,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:26,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:26,462 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:26,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:26,489 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:26,622 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates
[2024-11-08 00:18:26,622 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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:18:26,628 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 37 transitions. Complement of second has 3 states.
[2024-11-08 00:18:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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:18:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions.
[2024-11-08 00:18:26,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 10 letters.
[2024-11-08 00:18:26,630 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:26,630 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:18:26,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:26,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:26,649 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:26,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:26,668 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:26,781 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 7 loop predicates
[2024-11-08 00:18:26,781 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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:18:26,945 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 143 states and 168 transitions. Complement of second has 20 states.
[2024-11-08 00:18:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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:18:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions.
[2024-11-08 00:18:26,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 55 transitions. Stem has 11 letters. Loop has 10 letters.
[2024-11-08 00:18:26,946 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:26,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 55 transitions. Stem has 21 letters. Loop has 10 letters.
[2024-11-08 00:18:26,946 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:26,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 55 transitions. Stem has 11 letters. Loop has 20 letters.
[2024-11-08 00:18:26,946 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:26,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 168 transitions.
[2024-11-08 00:18:26,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65
[2024-11-08 00:18:26,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 139 states and 164 transitions.
[2024-11-08 00:18:26,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40
[2024-11-08 00:18:26,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41
[2024-11-08 00:18:26,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 164 transitions.
[2024-11-08 00:18:26,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:26,949 INFO L218 hiAutomatonCegarLoop]: Abstraction has 139 states and 164 transitions.
[2024-11-08 00:18:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 164 transitions.
[2024-11-08 00:18:26,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 72.
[2024-11-08 00:18:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 71 states have internal predecessors, (89), 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:18:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions.
[2024-11-08 00:18:26,953 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 89 transitions.
[2024-11-08 00:18:26,953 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 89 transitions.
[2024-11-08 00:18:26,953 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============
[2024-11-08 00:18:26,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 89 transitions.
[2024-11-08 00:18:26,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32
[2024-11-08 00:18:26,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:26,954 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:26,955 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:26,955 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:26,956 INFO L745 eck$LassoCheckResult]: Stem: 1525#$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(9, 2);~__BLAST_NONDET~0 := 0; 1504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 1498#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 1499#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 1503#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 1502#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 1500#L33-1 main_~i~0#1 := 0; 1501#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1529#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1538#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1534#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1536#L35-3
[2024-11-08 00:18:26,956 INFO L747 eck$LassoCheckResult]: Loop: 1536#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 1505#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1506#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1539#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1516#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1517#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1520#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1521#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1524#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1537#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 1533#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1532#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1509#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1510#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1536#L35-3
[2024-11-08 00:18:26,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:26,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903000, now seen corresponding path program 4 times
[2024-11-08 00:18:26,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:26,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495833132]
[2024-11-08 00:18:26,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:26,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:26,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:26,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:26,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:26,967 INFO L85 PathProgramCache]: Analyzing trace with hash -801853157, now seen corresponding path program 2 times
[2024-11-08 00:18:26,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:26,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012464760]
[2024-11-08 00:18:26,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:26,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:27,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:27,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012464760]
[2024-11-08 00:18:27,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012464760] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:27,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459962973]
[2024-11-08 00:18:27,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 00:18:27,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:27,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:27,106 INFO L229 MonitoredProcess]: Starting monitored process 32 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:18:27,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process
[2024-11-08 00:18:27,144 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 00:18:27,145 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:27,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:27,147 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:27,336 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459962973] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:27,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:27,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16
[2024-11-08 00:18:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520554510]
[2024-11-08 00:18:27,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:27,509 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:18:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-08 00:18:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272
[2024-11-08 00:18:27,509 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. cyclomatic complexity: 19 Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:28,265 INFO L93 Difference]: Finished difference Result 308 states and 365 transitions.
[2024-11-08 00:18:28,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 365 transitions.
[2024-11-08 00:18:28,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 150
[2024-11-08 00:18:28,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 308 states and 365 transitions.
[2024-11-08 00:18:28,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83
[2024-11-08 00:18:28,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83
[2024-11-08 00:18:28,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 365 transitions.
[2024-11-08 00:18:28,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:28,282 INFO L218 hiAutomatonCegarLoop]: Abstraction has 308 states and 365 transitions.
[2024-11-08 00:18:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 365 transitions.
[2024-11-08 00:18:28,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 224.
[2024-11-08 00:18:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 224 states have (on average 1.1830357142857142) internal successors, (265), 223 states have internal predecessors, (265), 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:18:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 265 transitions.
[2024-11-08 00:18:28,305 INFO L240 hiAutomatonCegarLoop]: Abstraction has 224 states and 265 transitions.
[2024-11-08 00:18:28,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2024-11-08 00:18:28,309 INFO L425 stractBuchiCegarLoop]: Abstraction has 224 states and 265 transitions.
[2024-11-08 00:18:28,309 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============
[2024-11-08 00:18:28,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 265 transitions.
[2024-11-08 00:18:28,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108
[2024-11-08 00:18:28,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:28,314 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:28,315 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:28,315 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:28,315 INFO L745 eck$LassoCheckResult]: Stem: 2043#$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(9, 2);~__BLAST_NONDET~0 := 0; 2024#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 2018#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 2019#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 2023#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 2022#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 2020#L33-1 main_~i~0#1 := 0; 2021#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 2047#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 2054#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2106#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 2105#L35-3
[2024-11-08 00:18:28,315 INFO L747 eck$LassoCheckResult]: Loop: 2105#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 2050#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2089#L18 assume !(0 == __VERIFIER_assert_~cond#1); 2085#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2086#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2081#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2082#L18 assume !(0 == __VERIFIER_assert_~cond#1); 2075#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2076#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2061#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2062#L18 assume !(0 == __VERIFIER_assert_~cond#1); 2057#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2058#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2052#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 2051#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2049#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 2030#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2031#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 2105#L35-3
[2024-11-08 00:18:28,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903000, now seen corresponding path program 5 times
[2024-11-08 00:18:28,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:28,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048919082]
[2024-11-08 00:18:28,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:28,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:28,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:28,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:28,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1595316203, now seen corresponding path program 3 times
[2024-11-08 00:18:28,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:28,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061201385]
[2024-11-08 00:18:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:28,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:28,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:28,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:28,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:28,404 INFO L85 PathProgramCache]: Analyzing trace with hash -935413038, now seen corresponding path program 2 times
[2024-11-08 00:18:28,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:28,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920222812]
[2024-11-08 00:18:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:28,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 00:18:28,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920222812]
[2024-11-08 00:18:28,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920222812] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987842972]
[2024-11-08 00:18:28,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 00:18:28,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:28,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:28,562 INFO L229 MonitoredProcess]: Starting monitored process 33 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:18:28,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process
[2024-11-08 00:18:28,601 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 00:18:28,602 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:28,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:28,603 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 00:18:28,665 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 00:18:28,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987842972] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:28,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:28,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2024-11-08 00:18:28,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663908086]
[2024-11-08 00:18:28,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:28,817 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:28,817 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:28,818 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:28,818 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:28,818 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:18:28,818 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:28,818 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:28,818 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:28,818 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration6_Loop
[2024-11-08 00:18:28,818 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:28,818 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:28,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:28,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:28,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:28,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:28,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:28,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:28,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:28,884 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:28,884 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:18:28,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:28,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:28,907 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:18:28,909 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:18:28,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:28,910 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:28,924 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:28,924 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:28,938 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:18:28,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:28,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:28,941 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:18:28,942 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:18:28,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:28,944 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:28,979 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:18:28,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:28,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:28,981 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:18:28,982 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:18:28,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:18:28,984 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:29,071 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:18:29,077 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:18:29,077 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:29,077 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:29,077 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:29,077 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:29,077 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:18:29,077 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:29,077 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:29,077 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:29,077 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration6_Loop
[2024-11-08 00:18:29,077 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:29,077 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:29,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,144 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:29,144 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:18:29,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:29,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:29,147 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:18:29,148 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:18:29,149 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:18:29,161 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:29,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:29,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:29,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:29,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:29,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:29,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:29,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:29,177 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:18:29,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:29,180 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:18:29,180 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:18:29,183 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:18:29,195 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:29,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:29,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:29,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:29,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:29,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:29,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:29,199 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:18:29,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:18:29,203 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:18:29,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:29,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:29,205 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:18:29,207 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:18:29,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:18:29,208 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:18:29,208 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:18:29,208 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5
Supporting invariants []
[2024-11-08 00:18:29,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:29,223 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:18:29,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:29,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:29,243 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:29,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:29,263 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:29,401 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates
[2024-11-08 00:18:29,401 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 224 states and 265 transitions. cyclomatic complexity: 43 Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:18:29,461 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:18:29,653 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 224 states and 265 transitions. cyclomatic complexity: 43. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 690 states and 823 transitions. Complement of second has 26 states.
[2024-11-08 00:18:29,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:18:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions.
[2024-11-08 00:18:29,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 11 letters. Loop has 18 letters.
[2024-11-08 00:18:29,656 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:29,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 29 letters. Loop has 18 letters.
[2024-11-08 00:18:29,656 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:29,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 11 letters. Loop has 36 letters.
[2024-11-08 00:18:29,657 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:29,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 690 states and 823 transitions.
[2024-11-08 00:18:29,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96
[2024-11-08 00:18:29,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 690 states to 547 states and 653 transitions.
[2024-11-08 00:18:29,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105
[2024-11-08 00:18:29,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107
[2024-11-08 00:18:29,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 653 transitions.
[2024-11-08 00:18:29,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:29,665 INFO L218 hiAutomatonCegarLoop]: Abstraction has 547 states and 653 transitions.
[2024-11-08 00:18:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 653 transitions.
[2024-11-08 00:18:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 355.
[2024-11-08 00:18:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 355 states have (on average 1.1971830985915493) internal successors, (425), 354 states have internal predecessors, (425), 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:18:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 425 transitions.
[2024-11-08 00:18:29,677 INFO L240 hiAutomatonCegarLoop]: Abstraction has 355 states and 425 transitions.
[2024-11-08 00:18:29,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:29,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 00:18:29,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2024-11-08 00:18:29,677 INFO L87 Difference]: Start difference. First operand 355 states and 425 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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:18:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:29,744 INFO L93 Difference]: Finished difference Result 409 states and 487 transitions.
[2024-11-08 00:18:29,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 487 transitions.
[2024-11-08 00:18:29,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 68
[2024-11-08 00:18:29,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 388 states and 463 transitions.
[2024-11-08 00:18:29,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79
[2024-11-08 00:18:29,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79
[2024-11-08 00:18:29,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 388 states and 463 transitions.
[2024-11-08 00:18:29,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:29,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 388 states and 463 transitions.
[2024-11-08 00:18:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states and 463 transitions.
[2024-11-08 00:18:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383.
[2024-11-08 00:18:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 383 states have (on average 1.195822454308094) internal successors, (458), 382 states have internal predecessors, (458), 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:18:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 458 transitions.
[2024-11-08 00:18:29,757 INFO L240 hiAutomatonCegarLoop]: Abstraction has 383 states and 458 transitions.
[2024-11-08 00:18:29,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 00:18:29,758 INFO L425 stractBuchiCegarLoop]: Abstraction has 383 states and 458 transitions.
[2024-11-08 00:18:29,758 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============
[2024-11-08 00:18:29,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 383 states and 458 transitions.
[2024-11-08 00:18:29,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 68
[2024-11-08 00:18:29,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:29,760 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:29,760 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:29,760 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:29,760 INFO L745 eck$LassoCheckResult]: Stem: 4057#$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(9, 2);~__BLAST_NONDET~0 := 0; 4035#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4029#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 4030#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 4034#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 4033#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 4031#L33-1 main_~i~0#1 := 0; 4032#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 4062#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 4129#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4127#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 4126#L35-3
[2024-11-08 00:18:29,760 INFO L747 eck$LassoCheckResult]: Loop: 4126#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 4125#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4051#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4052#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 4048#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4036#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 4037#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4126#L35-3
[2024-11-08 00:18:29,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:29,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903000, now seen corresponding path program 6 times
[2024-11-08 00:18:29,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:29,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985315720]
[2024-11-08 00:18:29,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:29,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:29,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:29,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:29,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash 21711760, now seen corresponding path program 1 times
[2024-11-08 00:18:29,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:29,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928585669]
[2024-11-08 00:18:29,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:29,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:29,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:29,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash 268169993, now seen corresponding path program 3 times
[2024-11-08 00:18:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:29,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696725740]
[2024-11-08 00:18:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:29,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:29,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:29,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:29,825 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:29,825 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:29,826 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:29,826 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:29,826 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:18:29,826 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:29,826 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:29,826 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:29,826 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration7_Loop
[2024-11-08 00:18:29,826 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:29,826 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:29,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:29,872 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:29,872 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:18:29,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:29,875 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:18:29,877 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:18:29,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:29,877 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:29,899 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:29,899 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:29,912 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:18:29,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:29,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:29,915 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:18:29,916 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:18:29,918 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:29,918 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:29,932 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:29,932 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:29,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:29,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:29,952 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:18:29,953 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:18:29,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:29,955 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:29,969 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:29,969 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:29,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:29,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:29,987 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:18:29,989 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:18:29,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:29,989 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:30,003 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:30,003 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:30,016 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:18:30,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:30,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:30,019 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:18:30,021 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:18:30,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:30,022 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:30,036 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:30,037 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:30,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0
[2024-11-08 00:18:30,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:30,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:30,055 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:18:30,056 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:18:30,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:30,058 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:30,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:30,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:30,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:30,089 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:18:30,090 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:18:30,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:18:30,091 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:30,220 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:18:30,225 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:18:30,226 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:30,226 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:30,226 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:30,226 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:30,226 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:18:30,226 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:30,226 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:30,226 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:30,226 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration7_Loop
[2024-11-08 00:18:30,226 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:30,226 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:30,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:30,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:30,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:30,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:30,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:30,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:30,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:30,287 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:30,287 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:18:30,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:30,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:30,290 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:18:30,291 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:18:30,293 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:18:30,304 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:30,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:30,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:30,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:30,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:30,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:30,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:30,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:30,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:30,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:30,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:30,323 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:18:30,324 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:18:30,325 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:18:30,337 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:30,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:30,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:30,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:30,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:30,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:30,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:30,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:30,353 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:18:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:30,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:30,356 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:18:30,357 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:18:30,361 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:18:30,373 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:30,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:30,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:30,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:30,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:30,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:30,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:30,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:30,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:30,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:30,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:30,390 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:18:30,392 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:18:30,393 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:18:30,404 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:30,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:30,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:30,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:30,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:30,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:30,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:30,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:30,419 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:18:30,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:30,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:30,422 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:18:30,423 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:18:30,425 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:18:30,436 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:30,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:30,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:30,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:30,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:30,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:30,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:30,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:30,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0
[2024-11-08 00:18:30,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:30,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:30,456 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:18:30,457 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:18:30,458 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:18:30,470 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:30,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:30,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:30,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:30,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:30,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:30,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:30,474 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:18:30,477 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:18:30,477 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:18:30,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:30,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:30,483 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:18:30,488 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:18:30,489 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:18:30,489 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:18:30,489 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:18:30,489 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1) = 3*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~j~0#1
Supporting invariants []
[2024-11-08 00:18:30,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0
[2024-11-08 00:18:30,506 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:18:30,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:30,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:30,547 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:30,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:30,568 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-08 00:18:30,612 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:18:30,612 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:30,623 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 383 states and 458 transitions. Complement of second has 3 states.
[2024-11-08 00:18:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions.
[2024-11-08 00:18:30,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 7 letters.
[2024-11-08 00:18:30,624 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:30,624 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:18:30,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:30,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:30,660 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:30,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:30,693 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-08 00:18:30,748 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:18:30,748 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:30,752 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 383 states and 458 transitions. Complement of second has 3 states.
[2024-11-08 00:18:30,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions.
[2024-11-08 00:18:30,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 7 letters.
[2024-11-08 00:18:30,761 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:30,761 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:18:30,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:30,809 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:18:30,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:30,811 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:30,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:30,844 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-08 00:18:30,892 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:18:30,892 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:30,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 815 states and 981 transitions. Complement of second has 4 states.
[2024-11-08 00:18:30,928 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:18:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:18:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions.
[2024-11-08 00:18:30,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 11 letters. Loop has 7 letters.
[2024-11-08 00:18:30,929 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:30,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 18 letters. Loop has 7 letters.
[2024-11-08 00:18:30,930 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:30,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 11 letters. Loop has 14 letters.
[2024-11-08 00:18:30,930 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:30,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 815 states and 981 transitions.
[2024-11-08 00:18:30,940 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70
[2024-11-08 00:18:30,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 815 states to 531 states and 628 transitions.
[2024-11-08 00:18:30,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60
[2024-11-08 00:18:30,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64
[2024-11-08 00:18:30,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 531 states and 628 transitions.
[2024-11-08 00:18:30,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:30,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 531 states and 628 transitions.
[2024-11-08 00:18:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states and 628 transitions.
[2024-11-08 00:18:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 378.
[2024-11-08 00:18:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 378 states have (on average 1.2063492063492063) internal successors, (456), 377 states have internal predecessors, (456), 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:18:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 456 transitions.
[2024-11-08 00:18:30,959 INFO L240 hiAutomatonCegarLoop]: Abstraction has 378 states and 456 transitions.
[2024-11-08 00:18:30,959 INFO L425 stractBuchiCegarLoop]: Abstraction has 378 states and 456 transitions.
[2024-11-08 00:18:30,959 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============
[2024-11-08 00:18:30,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 378 states and 456 transitions.
[2024-11-08 00:18:30,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66
[2024-11-08 00:18:30,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:30,961 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:30,962 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:30,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:30,962 INFO L745 eck$LassoCheckResult]: Stem: 6202#$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(9, 2);~__BLAST_NONDET~0 := 0; 6188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 6178#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 6179#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 6183#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 6182#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 6180#L33-1 main_~i~0#1 := 0; 6181#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 6205#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 6251#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 6252#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 6193#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 6194#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6543#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6542#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6541#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6493#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 6494#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6544#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 6277#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 6244#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 6243#L35-3
[2024-11-08 00:18:30,962 INFO L747 eck$LassoCheckResult]: Loop: 6243#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 6209#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6262#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6261#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6236#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6237#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6232#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6233#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6228#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6229#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6225#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6224#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6223#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6221#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6220#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6219#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6217#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6218#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6212#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6214#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6213#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6211#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 6210#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6208#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 6189#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 6190#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 6243#L35-3
[2024-11-08 00:18:30,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash 413129778, now seen corresponding path program 4 times
[2024-11-08 00:18:30,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:30,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235943706]
[2024-11-08 00:18:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:30,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:30,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:30,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1530834315, now seen corresponding path program 4 times
[2024-11-08 00:18:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470937244]
[2024-11-08 00:18:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:31,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:31,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:31,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:31,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2114436732, now seen corresponding path program 5 times
[2024-11-08 00:18:31,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:31,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233705988]
[2024-11-08 00:18:31,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:31,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked.
[2024-11-08 00:18:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233705988]
[2024-11-08 00:18:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233705988] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362639633]
[2024-11-08 00:18:31,152 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-08 00:18:31,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:31,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:31,154 INFO L229 MonitoredProcess]: Starting monitored process 54 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:18:31,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process
[2024-11-08 00:18:31,203 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2024-11-08 00:18:31,203 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:31,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:31,205 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 68 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-08 00:18:31,519 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 68 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-08 00:18:31,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362639633] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:31,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:31,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 31
[2024-11-08 00:18:31,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543678576]
[2024-11-08 00:18:31,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:31,989 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:31,989 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:31,989 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:31,989 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:31,989 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:18:31,989 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:31,989 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:31,989 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:31,989 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration8_Loop
[2024-11-08 00:18:31,989 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:31,989 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:31,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:31,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:31,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:31,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:31,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:32,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:32,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:32,051 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:32,051 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:18:32,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:32,054 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:18:32,056 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:18:32,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:32,057 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:32,070 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:32,071 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:32,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:32,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:32,088 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:18:32,089 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:18:32,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:32,090 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:32,105 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:32,105 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:32,120 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:18:32,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:32,123 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:18:32,125 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:18:32,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:32,126 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:32,143 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:32,143 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:32,157 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:18:32,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:32,160 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:18:32,161 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:18:32,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:32,162 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:32,177 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:32,178 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:32,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:32,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:32,195 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:18:32,196 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:18:32,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:32,198 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:32,232 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:18:32,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:32,235 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:18:32,236 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:18:32,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:18:32,238 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:32,327 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:18:32,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:32,333 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:32,333 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:32,333 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:32,333 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:32,333 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:18:32,333 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,333 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:32,333 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:32,333 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration8_Loop
[2024-11-08 00:18:32,333 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:32,333 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:32,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:32,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:32,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:32,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:32,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:32,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:32,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:32,393 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:32,393 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:18:32,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:32,397 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:18:32,398 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:18:32,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:18:32,411 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:32,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:32,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:32,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:32,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:32,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:32,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:32,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:32,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:32,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:32,429 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:18:32,430 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:18:32,431 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:18:32,444 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:32,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:32,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:32,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:32,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:32,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:32,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:32,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:32,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:32,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:32,463 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:18:32,464 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:18:32,465 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:18:32,478 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:32,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:32,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:32,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:32,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:32,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:32,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:32,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:32,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:32,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:32,498 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:18:32,499 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:18:32,500 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:18:32,512 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:32,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:32,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:32,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:32,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:32,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:32,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:32,518 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:18:32,521 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:18:32,521 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:18:32,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:32,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:32,526 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:18:32,527 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:18:32,528 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:18:32,528 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:18:32,528 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:18:32,528 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 7
Supporting invariants []
[2024-11-08 00:18:32,542 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:18:32,543 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:18:32,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:32,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:32,565 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:32,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:32,615 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:32,746 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:18:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:32,893 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates
[2024-11-08 00:18:32,893 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 378 states and 456 transitions. cyclomatic complexity: 86 Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 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:18:33,254 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 378 states and 456 transitions. cyclomatic complexity: 86. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 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 1442 states and 1730 transitions. Complement of second has 34 states.
[2024-11-08 00:18:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 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:18:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 85 transitions.
[2024-11-08 00:18:33,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 85 transitions. Stem has 21 letters. Loop has 26 letters.
[2024-11-08 00:18:33,260 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:33,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 85 transitions. Stem has 47 letters. Loop has 26 letters.
[2024-11-08 00:18:33,260 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:33,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 85 transitions. Stem has 21 letters. Loop has 52 letters.
[2024-11-08 00:18:33,260 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:33,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1442 states and 1730 transitions.
[2024-11-08 00:18:33,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 119
[2024-11-08 00:18:33,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1442 states to 953 states and 1144 transitions.
[2024-11-08 00:18:33,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67
[2024-11-08 00:18:33,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67
[2024-11-08 00:18:33,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 953 states and 1144 transitions.
[2024-11-08 00:18:33,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:33,289 INFO L218 hiAutomatonCegarLoop]: Abstraction has 953 states and 1144 transitions.
[2024-11-08 00:18:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states and 1144 transitions.
[2024-11-08 00:18:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 528.
[2024-11-08 00:18:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 528 states have (on average 1.2121212121212122) internal successors, (640), 527 states have internal predecessors, (640), 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:18:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 640 transitions.
[2024-11-08 00:18:33,309 INFO L240 hiAutomatonCegarLoop]: Abstraction has 528 states and 640 transitions.
[2024-11-08 00:18:33,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:33,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-11-08 00:18:33,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930
[2024-11-08 00:18:33,314 INFO L87 Difference]: Start difference. First operand 528 states and 640 transitions. Second operand has 31 states, 31 states have (on average 3.129032258064516) internal successors, (97), 31 states have internal predecessors, (97), 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:18:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:36,068 INFO L93 Difference]: Finished difference Result 4214 states and 4866 transitions.
[2024-11-08 00:18:36,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4214 states and 4866 transitions.
[2024-11-08 00:18:36,116 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 388
[2024-11-08 00:18:36,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4214 states to 1604 states and 1883 transitions.
[2024-11-08 00:18:36,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101
[2024-11-08 00:18:36,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104
[2024-11-08 00:18:36,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1604 states and 1883 transitions.
[2024-11-08 00:18:36,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:36,137 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1604 states and 1883 transitions.
[2024-11-08 00:18:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states and 1883 transitions.
[2024-11-08 00:18:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 894.
[2024-11-08 00:18:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 894 states have (on average 1.1733780760626398) internal successors, (1049), 893 states have internal predecessors, (1049), 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:18:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1049 transitions.
[2024-11-08 00:18:36,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 894 states and 1049 transitions.
[2024-11-08 00:18:36,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states.
[2024-11-08 00:18:36,185 INFO L425 stractBuchiCegarLoop]: Abstraction has 894 states and 1049 transitions.
[2024-11-08 00:18:36,185 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============
[2024-11-08 00:18:36,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 894 states and 1049 transitions.
[2024-11-08 00:18:36,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 168
[2024-11-08 00:18:36,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:36,194 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:36,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:36,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2024-11-08 00:18:36,198 INFO L745 eck$LassoCheckResult]: Stem: 13498#$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(9, 2);~__BLAST_NONDET~0 := 0; 13483#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 13472#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 13473#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 13477#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 13476#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 13474#L33-1 main_~i~0#1 := 0; 13475#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 13506#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 13507#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13591#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 13488#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 13489#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13647#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13646#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13645#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13632#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 13633#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13648#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 13649#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13809#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 13808#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 13807#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13806#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13805#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13804#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13803#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13801#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13800#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13799#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13798#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 13797#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13796#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 13794#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13795#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13790#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13791#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13786#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13787#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13782#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13783#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13779#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13778#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13777#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13776#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13650#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 13651#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13595#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 13596#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13767#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 13770#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 14091#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 14092#L18 assume !(0 == __VERIFIER_assert_~cond#1); 14087#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 14088#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 14082#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 14083#L18 assume !(0 == __VERIFIER_assert_~cond#1); 14078#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 14079#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 14073#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 14075#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14201#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 13478#L36-3
[2024-11-08 00:18:36,198 INFO L747 eck$LassoCheckResult]: Loop: 13478#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13479#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13494#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13492#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13478#L36-3
[2024-11-08 00:18:36,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1573021760, now seen corresponding path program 6 times
[2024-11-08 00:18:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:36,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473807683]
[2024-11-08 00:18:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 51 proven. 85 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked.
[2024-11-08 00:18:36,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:36,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473807683]
[2024-11-08 00:18:36,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473807683] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:36,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937075405]
[2024-11-08 00:18:36,556 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-08 00:18:36,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:36,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:36,559 INFO L229 MonitoredProcess]: Starting monitored process 66 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:18:36,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process
[2024-11-08 00:18:36,628 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s)
[2024-11-08 00:18:36,628 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:36,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:36,631 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 114 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-08 00:18:36,828 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 122 proven. 37 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-08 00:18:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937075405] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:36,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:36,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 20
[2024-11-08 00:18:36,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280020404]
[2024-11-08 00:18:36,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:36,962 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 00:18:36,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2415153, now seen corresponding path program 1 times
[2024-11-08 00:18:36,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:36,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864839519]
[2024-11-08 00:18:36,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:36,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:36,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:36,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:37,015 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:37,015 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:37,015 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:37,015 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:37,015 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:18:37,016 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:37,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:37,016 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:37,016 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration9_Loop
[2024-11-08 00:18:37,016 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:37,016 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:37,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:37,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:37,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:37,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:37,068 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:37,068 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:18:37,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:37,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:37,072 INFO L229 MonitoredProcess]: Starting monitored process 67 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:18:37,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process
[2024-11-08 00:18:37,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:37,077 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:37,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:37,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:37,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:37,109 INFO L229 MonitoredProcess]: Starting monitored process 68 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:18:37,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process
[2024-11-08 00:18:37,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:18:37,112 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:37,315 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:18:37,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:37,322 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:37,322 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:37,322 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:37,322 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:37,322 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:18:37,322 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:37,322 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:37,322 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:37,322 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration9_Loop
[2024-11-08 00:18:37,322 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:37,322 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:37,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:37,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:37,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:37,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:37,363 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:37,364 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:18:37,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:37,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:37,366 INFO L229 MonitoredProcess]: Starting monitored process 69 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:18:37,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process
[2024-11-08 00:18:37,368 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:18:37,381 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:37,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:37,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:37,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:37,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:37,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:37,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:37,385 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:18:37,387 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:18:37,388 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:18:37,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:37,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:37,390 INFO L229 MonitoredProcess]: Starting monitored process 70 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:18:37,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process
[2024-11-08 00:18:37,392 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:18:37,393 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:18:37,393 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:18:37,393 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~k~0#1) = 4*ULTIMATE.start_main_~n~0#1 + 2*ULTIMATE.start_main_~i~0#1 - 2*ULTIMATE.start_main_~k~0#1 + 1
Supporting invariants []
[2024-11-08 00:18:37,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:37,408 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:18:37,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:37,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:37,448 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:37,505 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:37,505 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:37,548 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:18:37,549 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates
[2024-11-08 00:18:37,549 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 894 states and 1049 transitions. cyclomatic complexity: 164 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:18:37,577 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 894 states and 1049 transitions. cyclomatic complexity: 164. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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 902 states and 1057 transitions. Complement of second has 7 states.
[2024-11-08 00:18:37,577 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:18:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:18:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions.
[2024-11-08 00:18:37,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 62 letters. Loop has 4 letters.
[2024-11-08 00:18:37,579 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:37,579 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:18:37,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:37,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:37,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:37,648 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:37,706 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:37,706 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:37,747 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:18:37,747 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates
[2024-11-08 00:18:37,748 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 894 states and 1049 transitions. cyclomatic complexity: 164 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:18:37,772 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 894 states and 1049 transitions. cyclomatic complexity: 164. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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 902 states and 1057 transitions. Complement of second has 7 states.
[2024-11-08 00:18:37,772 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:18:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:18:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions.
[2024-11-08 00:18:37,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 62 letters. Loop has 4 letters.
[2024-11-08 00:18:37,773 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:37,773 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:18:37,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:37,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:37,809 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:37,868 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:37,869 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:37,912 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:18:37,913 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 3 loop predicates
[2024-11-08 00:18:37,913 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 894 states and 1049 transitions. cyclomatic complexity: 164 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:18:37,943 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 894 states and 1049 transitions. cyclomatic complexity: 164. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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 1417 states and 1598 transitions. Complement of second has 6 states.
[2024-11-08 00:18:37,943 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:18:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:18:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions.
[2024-11-08 00:18:37,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 62 letters. Loop has 4 letters.
[2024-11-08 00:18:37,944 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:37,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 66 letters. Loop has 4 letters.
[2024-11-08 00:18:37,945 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:37,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 62 letters. Loop has 8 letters.
[2024-11-08 00:18:37,945 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:37,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1417 states and 1598 transitions.
[2024-11-08 00:18:37,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 164
[2024-11-08 00:18:37,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1417 states to 890 states and 1033 transitions.
[2024-11-08 00:18:37,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2024-11-08 00:18:37,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2024-11-08 00:18:37,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 890 states and 1033 transitions.
[2024-11-08 00:18:37,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:37,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 890 states and 1033 transitions.
[2024-11-08 00:18:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states and 1033 transitions.
[2024-11-08 00:18:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890.
[2024-11-08 00:18:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 890 states have (on average 1.1606741573033708) internal successors, (1033), 889 states have internal predecessors, (1033), 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:18:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1033 transitions.
[2024-11-08 00:18:37,968 INFO L240 hiAutomatonCegarLoop]: Abstraction has 890 states and 1033 transitions.
[2024-11-08 00:18:37,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:37,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-11-08 00:18:37,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380
[2024-11-08 00:18:37,969 INFO L87 Difference]: Start difference. First operand 890 states and 1033 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 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:18:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:38,380 INFO L93 Difference]: Finished difference Result 498 states and 563 transitions.
[2024-11-08 00:18:38,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 563 transitions.
[2024-11-08 00:18:38,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 97
[2024-11-08 00:18:38,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 498 states and 563 transitions.
[2024-11-08 00:18:38,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2024-11-08 00:18:38,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2024-11-08 00:18:38,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 498 states and 563 transitions.
[2024-11-08 00:18:38,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:38,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 498 states and 563 transitions.
[2024-11-08 00:18:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states and 563 transitions.
[2024-11-08 00:18:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 480.
[2024-11-08 00:18:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 480 states have (on average 1.1354166666666667) internal successors, (545), 479 states have internal predecessors, (545), 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:18:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 545 transitions.
[2024-11-08 00:18:38,412 INFO L240 hiAutomatonCegarLoop]: Abstraction has 480 states and 545 transitions.
[2024-11-08 00:18:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2024-11-08 00:18:38,413 INFO L425 stractBuchiCegarLoop]: Abstraction has 480 states and 545 transitions.
[2024-11-08 00:18:38,413 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============
[2024-11-08 00:18:38,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 480 states and 545 transitions.
[2024-11-08 00:18:38,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 94
[2024-11-08 00:18:38,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:38,415 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:38,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 15, 15, 5, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:38,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 9, 9, 2, 2, 2, 1, 1, 1]
[2024-11-08 00:18:38,416 INFO L745 eck$LassoCheckResult]: Stem: 20047#$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(9, 2);~__BLAST_NONDET~0 := 0; 20034#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 20028#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 20029#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 20033#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 20032#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 20030#L33-1 main_~i~0#1 := 0; 20031#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 20054#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 20037#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 20038#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 20041#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 20042#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20379#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20378#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20377#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20376#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 20375#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 20374#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 20373#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 20372#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 20371#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 20370#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20369#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20368#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20367#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20365#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20364#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20363#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20362#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20361#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 20360#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 20359#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 20231#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20356#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20339#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20278#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20276#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20274#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20271#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20240#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20237#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20236#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20235#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20234#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20233#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 20232#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 20230#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 20229#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 20226#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 20225#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 20224#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20223#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20222#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20221#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20220#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20219#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20102#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20098#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20099#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20101#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20100#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20087#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20088#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 20061#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 20085#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 20053#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20084#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20083#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20082#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20081#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20080#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20079#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20078#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20077#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20076#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20075#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20074#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20072#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20073#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20069#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20068#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20066#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20067#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20180#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20177#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20060#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20057#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20059#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20058#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20056#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 20055#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 20051#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 20052#L34-2
[2024-11-08 00:18:38,417 INFO L747 eck$LassoCheckResult]: Loop: 20052#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 20218#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 20214#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 20213#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20212#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20211#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20210#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20209#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20208#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20207#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20206#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20205#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20204#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20203#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20202#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20197#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 20196#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 20195#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 20194#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20192#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20190#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20188#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20186#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20185#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20184#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20183#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20182#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20181#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20179#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20176#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20174#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20070#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20071#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20178#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20173#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20065#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20064#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20062#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20063#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 20175#L18 assume !(0 == __VERIFIER_assert_~cond#1); 20193#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 20191#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 20189#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 20187#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 20171#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 20052#L34-2
[2024-11-08 00:18:38,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:38,417 INFO L85 PathProgramCache]: Analyzing trace with hash 274643133, now seen corresponding path program 7 times
[2024-11-08 00:18:38,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:38,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689218294]
[2024-11-08 00:18:38,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:38,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 41 proven. 381 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked.
[2024-11-08 00:18:38,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:38,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689218294]
[2024-11-08 00:18:38,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689218294] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:38,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786868898]
[2024-11-08 00:18:38,645 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-08 00:18:38,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:38,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:38,650 INFO L229 MonitoredProcess]: Starting monitored process 71 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:18:38,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process
[2024-11-08 00:18:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:38,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:38,728 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 154 proven. 330 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked.
[2024-11-08 00:18:39,171 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 154 proven. 330 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked.
[2024-11-08 00:18:39,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786868898] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:39,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:39,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 27
[2024-11-08 00:18:39,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434616797]
[2024-11-08 00:18:39,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:39,459 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 00:18:39,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:39,459 INFO L85 PathProgramCache]: Analyzing trace with hash 492043776, now seen corresponding path program 5 times
[2024-11-08 00:18:39,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:39,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379963206]
[2024-11-08 00:18:39,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:39,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 6 proven. 95 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2024-11-08 00:18:39,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379963206]
[2024-11-08 00:18:39,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379963206] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426120758]
[2024-11-08 00:18:39,618 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-08 00:18:39,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:39,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:39,621 INFO L229 MonitoredProcess]: Starting monitored process 72 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:18:39,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process
[2024-11-08 00:18:39,683 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s)
[2024-11-08 00:18:39,683 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:39,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:39,685 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 83 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:39,867 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 83 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:18:40,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426120758] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:40,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:40,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 24
[2024-11-08 00:18:40,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903888126]
[2024-11-08 00:18:40,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:40,044 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:18:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:40,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-11-08 00:18:40,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552
[2024-11-08 00:18:40,044 INFO L87 Difference]: Start difference. First operand 480 states and 545 transitions. cyclomatic complexity: 76 Second operand has 24 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 24 states have internal predecessors, (82), 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:18:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:40,958 INFO L93 Difference]: Finished difference Result 1202 states and 1315 transitions.
[2024-11-08 00:18:40,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1202 states and 1315 transitions.
[2024-11-08 00:18:40,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177
[2024-11-08 00:18:40,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1202 states to 1202 states and 1315 transitions.
[2024-11-08 00:18:40,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2024-11-08 00:18:40,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2024-11-08 00:18:40,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1202 states and 1315 transitions.
[2024-11-08 00:18:40,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:40,971 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1202 states and 1315 transitions.
[2024-11-08 00:18:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states and 1315 transitions.
[2024-11-08 00:18:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 826.
[2024-11-08 00:18:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 826 states have (on average 1.1101694915254237) internal successors, (917), 825 states have internal predecessors, (917), 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:18:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 917 transitions.
[2024-11-08 00:18:40,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 826 states and 917 transitions.
[2024-11-08 00:18:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states.
[2024-11-08 00:18:40,983 INFO L425 stractBuchiCegarLoop]: Abstraction has 826 states and 917 transitions.
[2024-11-08 00:18:40,984 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============
[2024-11-08 00:18:40,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 826 states and 917 transitions.
[2024-11-08 00:18:40,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118
[2024-11-08 00:18:40,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:40,989 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:40,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [30, 30, 30, 30, 9, 9, 9, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:40,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 15, 15, 3, 3, 3, 1, 1, 1]
[2024-11-08 00:18:40,993 INFO L745 eck$LassoCheckResult]: Stem: 22698#$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(9, 2);~__BLAST_NONDET~0 := 0; 22686#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 22678#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 22679#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 22683#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 22682#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 22680#L33-1 main_~i~0#1 := 0; 22681#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 22704#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 22705#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 22700#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 22701#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 22963#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22968#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22967#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22966#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22965#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 22964#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 22962#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 22961#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 22960#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 22959#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 22958#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22957#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22956#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22955#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22953#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22952#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22951#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22950#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22949#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 22948#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 22947#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 22933#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22946#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22945#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22944#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22943#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22942#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22941#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22940#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22939#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22938#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22937#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22936#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22935#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 22934#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 22932#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 22931#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 22928#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 22930#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23441#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23440#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23439#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 23438#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23437#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23436#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23435#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 23434#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23433#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23432#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23431#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 23430#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23428#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 23429#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 23461#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23459#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23458#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23457#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 23456#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23455#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23454#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23453#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 23452#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23451#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23450#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23449#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 23448#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23447#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 23310#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 23309#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 22991#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23304#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23305#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 23296#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23297#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23290#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23291#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 23283#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23284#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23276#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23277#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 23229#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23230#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 23267#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 22990#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 22988#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 22989#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 22985#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 22692#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22984#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22983#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22982#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22981#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22980#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22979#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22978#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22977#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22976#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22975#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22974#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22973#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22972#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22971#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22970#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22969#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 22770#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 22924#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 22922#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22920#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22918#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22916#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22914#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22912#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22910#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22908#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22906#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22904#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22902#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22900#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22898#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22896#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22894#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22893#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22769#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22768#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22767#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22766#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22765#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 22764#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 22762#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 22763#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22759#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22760#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22755#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22756#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22751#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22752#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22747#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22748#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22743#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22744#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22739#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22740#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22734#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22735#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22730#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22731#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22725#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22726#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22721#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22722#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22717#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22718#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22713#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22714#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 22708#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 22709#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 22822#L34-2
[2024-11-08 00:18:40,994 INFO L747 eck$LassoCheckResult]: Loop: 22822#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 22820#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 22817#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 22815#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22814#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22813#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22812#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22811#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22810#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22809#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22808#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22807#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22806#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22805#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22804#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22803#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22802#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22801#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22800#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22799#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 22770#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 22924#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 22922#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22920#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22918#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22916#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22914#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22912#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22910#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22908#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22906#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22904#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22902#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22900#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22898#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22896#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22894#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22893#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22769#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22768#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22767#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22766#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22765#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 22764#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 22762#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 22763#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22759#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22760#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22755#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22756#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22751#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22752#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22747#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22748#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22743#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22744#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22739#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22740#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22734#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22735#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22730#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22731#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22725#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22726#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22721#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22722#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 22717#L18 assume !(0 == __VERIFIER_assert_~cond#1); 22718#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 22713#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22714#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 22708#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 22709#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 22822#L34-2
[2024-11-08 00:18:40,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:40,994 INFO L85 PathProgramCache]: Analyzing trace with hash -991352360, now seen corresponding path program 8 times
[2024-11-08 00:18:40,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:40,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592185037]
[2024-11-08 00:18:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 1139 proven. 263 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked.
[2024-11-08 00:18:41,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592185037]
[2024-11-08 00:18:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592185037] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026294473]
[2024-11-08 00:18:41,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 00:18:41,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:41,322 INFO L229 MonitoredProcess]: Starting monitored process 73 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:18:41,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process
[2024-11-08 00:18:41,413 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 00:18:41,414 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:41,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:41,418 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 1254 proven. 148 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked.
[2024-11-08 00:18:41,621 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 1149 proven. 253 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked.
[2024-11-08 00:18:41,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026294473] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:41,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:41,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19
[2024-11-08 00:18:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200601846]
[2024-11-08 00:18:41,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:41,770 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 00:18:41,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:41,771 INFO L85 PathProgramCache]: Analyzing trace with hash -549720533, now seen corresponding path program 6 times
[2024-11-08 00:18:41,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:41,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443077252]
[2024-11-08 00:18:41,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:41,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 15 proven. 351 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked.
[2024-11-08 00:18:41,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:41,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443077252]
[2024-11-08 00:18:41,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443077252] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:41,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969758897]
[2024-11-08 00:18:41,930 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-08 00:18:41,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:41,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:41,933 INFO L229 MonitoredProcess]: Starting monitored process 74 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:18:41,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process
[2024-11-08 00:18:41,998 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s)
[2024-11-08 00:18:41,998 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:41,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:42,001 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 28 proven. 355 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked.
[2024-11-08 00:18:42,265 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 45 proven. 338 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked.
[2024-11-08 00:18:42,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969758897] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:42,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:42,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26
[2024-11-08 00:18:42,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207825292]
[2024-11-08 00:18:42,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:42,545 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:18:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:42,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-11-08 00:18:42,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702
[2024-11-08 00:18:42,546 INFO L87 Difference]: Start difference. First operand 826 states and 917 transitions. cyclomatic complexity: 100 Second operand has 27 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 27 states have internal predecessors, (100), 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:18:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:43,509 INFO L93 Difference]: Finished difference Result 2334 states and 2558 transitions.
[2024-11-08 00:18:43,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2334 states and 2558 transitions.
[2024-11-08 00:18:43,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 457
[2024-11-08 00:18:43,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2334 states to 2334 states and 2558 transitions.
[2024-11-08 00:18:43,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2024-11-08 00:18:43,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2024-11-08 00:18:43,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2334 states and 2558 transitions.
[2024-11-08 00:18:43,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:43,525 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2334 states and 2558 transitions.
[2024-11-08 00:18:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states and 2558 transitions.
[2024-11-08 00:18:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 1245.
[2024-11-08 00:18:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1245 states have (on average 1.1076305220883533) internal successors, (1379), 1244 states have internal predecessors, (1379), 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:18:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1379 transitions.
[2024-11-08 00:18:43,544 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1245 states and 1379 transitions.
[2024-11-08 00:18:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2024-11-08 00:18:43,545 INFO L425 stractBuchiCegarLoop]: Abstraction has 1245 states and 1379 transitions.
[2024-11-08 00:18:43,545 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============
[2024-11-08 00:18:43,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1245 states and 1379 transitions.
[2024-11-08 00:18:43,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 187
[2024-11-08 00:18:43,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:43,548 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:43,549 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [33, 33, 33, 33, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:43,550 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 18, 18, 4, 4, 4, 1, 1, 1]
[2024-11-08 00:18:43,550 INFO L745 eck$LassoCheckResult]: Stem: 27417#$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(9, 2);~__BLAST_NONDET~0 := 0; 27403#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 27397#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 27398#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 27402#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 27401#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 27399#L33-1 main_~i~0#1 := 0; 27400#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27426#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27406#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 27407#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27410#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27411#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27766#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27764#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27762#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27760#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27758#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27757#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27756#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 27755#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27753#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27751#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27749#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27747#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27745#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27742#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27740#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27738#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27736#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27734#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27730#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27729#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27715#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27728#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27727#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27726#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27725#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27724#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27723#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27722#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27721#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27720#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27719#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27718#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27717#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27716#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27714#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27713#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 27710#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27712#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 28573#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28572#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28571#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28570#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28569#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28568#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28567#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28566#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28565#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28564#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28563#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28562#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28561#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 28542#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 28631#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 28629#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28628#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28627#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28625#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28624#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28623#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28621#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28620#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28619#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28617#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28616#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28615#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28612#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 28503#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 28319#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27662#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28316#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28314#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28315#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28626#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28310#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28308#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28309#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28618#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28304#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28303#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28301#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28302#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 28258#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27661#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27659#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 27660#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27657#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27652#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27653#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27648#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27649#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27644#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27645#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27640#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27641#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27636#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27637#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27632#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27633#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27628#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27504#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 28233#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 28232#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28231#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28230#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28229#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28228#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28227#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28226#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28225#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28224#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28223#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28222#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28221#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28220#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28219#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28218#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28217#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28216#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27494#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27825#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27822#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27819#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27816#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27813#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27810#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27807#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27804#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27801#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27798#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27794#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27791#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27788#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27785#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27781#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27778#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27775#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27493#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27492#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27491#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27490#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27487#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27483#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27481#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27482#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27478#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27479#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27474#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27475#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27470#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27471#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27466#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27467#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27462#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27463#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27458#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27459#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27453#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27454#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27449#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27450#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27444#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27445#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27440#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27441#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27436#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27437#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27432#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27433#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27427#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27428#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27598#L34-2
[2024-11-08 00:18:43,550 INFO L747 eck$LassoCheckResult]: Loop: 27598#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 27596#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27593#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27591#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27590#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27589#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27588#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27587#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27586#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27585#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27584#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27583#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27582#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27581#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27580#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27579#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27504#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 28233#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 28232#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28231#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28230#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28229#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28228#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28227#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28226#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28225#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28224#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28223#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28222#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28221#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28220#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 28219#L18 assume !(0 == __VERIFIER_assert_~cond#1); 28218#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 28217#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 28216#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27494#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27825#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27822#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27819#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27816#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27813#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27810#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27807#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27804#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27801#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27798#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27794#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27791#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27788#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27785#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27781#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27778#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27775#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27493#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27492#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27491#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27490#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27487#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27483#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27481#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27482#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27478#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27479#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27474#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27475#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27470#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27471#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27466#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27467#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27462#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27463#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27458#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27459#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27453#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27454#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27449#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27450#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27444#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27445#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27440#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27441#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27436#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27437#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27432#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27433#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27427#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27428#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27598#L34-2
[2024-11-08 00:18:43,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash -373493117, now seen corresponding path program 9 times
[2024-11-08 00:18:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932803176]
[2024-11-08 00:18:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 1327 proven. 263 refuted. 0 times theorem prover too weak. 1063 trivial. 0 not checked.
[2024-11-08 00:18:43,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:43,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932803176]
[2024-11-08 00:18:43,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932803176] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:43,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140477537]
[2024-11-08 00:18:43,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 00:18:43,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:43,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:43,826 INFO L229 MonitoredProcess]: Starting monitored process 75 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:18:43,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process
[2024-11-08 00:18:43,906 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2024-11-08 00:18:43,906 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:43,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:43,909 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 1798 proven. 15 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2024-11-08 00:18:44,106 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 1608 proven. 205 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2024-11-08 00:18:44,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140477537] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:44,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:44,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25
[2024-11-08 00:18:44,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979100770]
[2024-11-08 00:18:44,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:44,296 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 00:18:44,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1901370832, now seen corresponding path program 7 times
[2024-11-08 00:18:44,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:44,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725826574]
[2024-11-08 00:18:44,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:44,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 388 proven. 209 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2024-11-08 00:18:44,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725826574]
[2024-11-08 00:18:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725826574] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969679333]
[2024-11-08 00:18:44,475 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-08 00:18:44,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:44,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:44,481 INFO L229 MonitoredProcess]: Starting monitored process 76 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:18:44,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process
[2024-11-08 00:18:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:44,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:44,559 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 425 proven. 142 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked.
[2024-11-08 00:18:44,825 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 552 proven. 15 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked.
[2024-11-08 00:18:45,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969679333] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:45,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:45,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 28
[2024-11-08 00:18:45,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694288320]
[2024-11-08 00:18:45,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:45,020 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:18:45,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:45,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-11-08 00:18:45,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756
[2024-11-08 00:18:45,021 INFO L87 Difference]: Start difference. First operand 1245 states and 1379 transitions. cyclomatic complexity: 146 Second operand has 28 states, 28 states have (on average 3.7857142857142856) internal successors, (106), 28 states have internal predecessors, (106), 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:18:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:46,022 INFO L93 Difference]: Finished difference Result 1919 states and 2100 transitions.
[2024-11-08 00:18:46,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1919 states and 2100 transitions.
[2024-11-08 00:18:46,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 269
[2024-11-08 00:18:46,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1919 states to 1392 states and 1476 transitions.
[2024-11-08 00:18:46,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2024-11-08 00:18:46,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22
[2024-11-08 00:18:46,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1392 states and 1476 transitions.
[2024-11-08 00:18:46,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:46,035 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1392 states and 1476 transitions.
[2024-11-08 00:18:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states and 1476 transitions.
[2024-11-08 00:18:46,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1379.
[2024-11-08 00:18:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1379 states have (on average 1.0609137055837563) internal successors, (1463), 1378 states have internal predecessors, (1463), 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:18:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1463 transitions.
[2024-11-08 00:18:46,052 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1379 states and 1463 transitions.
[2024-11-08 00:18:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states.
[2024-11-08 00:18:46,052 INFO L425 stractBuchiCegarLoop]: Abstraction has 1379 states and 1463 transitions.
[2024-11-08 00:18:46,053 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============
[2024-11-08 00:18:46,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1379 states and 1463 transitions.
[2024-11-08 00:18:46,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 268
[2024-11-08 00:18:46,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:46,055 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:46,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 37, 37, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:46,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 21, 21, 4, 4, 4, 1, 1, 1]
[2024-11-08 00:18:46,058 INFO L745 eck$LassoCheckResult]: Stem: 32348#$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(9, 2);~__BLAST_NONDET~0 := 0; 32337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 32329#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 32330#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 32334#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 32333#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 32331#L33-1 main_~i~0#1 := 0; 32332#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 32353#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 32743#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 32742#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 32741#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32740#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32739#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32738#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32737#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32736#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32735#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32734#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 32733#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 32732#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 32731#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32730#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32729#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32728#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32727#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32726#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32725#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32724#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32723#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32722#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32721#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32720#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32719#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32718#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32717#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32716#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32715#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32714#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32713#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32712#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32711#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32710#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32709#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32708#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32707#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32706#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32705#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 32704#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 32702#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 32344#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32335#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32336#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32347#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32345#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32346#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 33707#L18 assume !(0 == __VERIFIER_assert_~cond#1); 33706#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 33705#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 33704#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 33703#L18 assume !(0 == __VERIFIER_assert_~cond#1); 33702#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 33700#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 33697#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32351#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32352#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 33694#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 33692#L18 assume !(0 == __VERIFIER_assert_~cond#1); 33690#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 33688#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 33686#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 33684#L18 assume !(0 == __VERIFIER_assert_~cond#1); 33682#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 33680#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 33678#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 33676#L18 assume !(0 == __VERIFIER_assert_~cond#1); 33674#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 33672#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 33670#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 33668#L18 assume !(0 == __VERIFIER_assert_~cond#1); 33666#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 33664#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 33662#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 33660#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 33238#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 33235#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 33234#L18 assume !(0 == __VERIFIER_assert_~cond#1); 33233#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 33231#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 33232#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 33511#L18 assume !(0 == __VERIFIER_assert_~cond#1); 33507#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 33503#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 33499#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 33495#L18 assume !(0 == __VERIFIER_assert_~cond#1); 33491#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 33487#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 33483#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 33293#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32788#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 32789#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 33603#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 32783#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32343#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32782#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32781#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32780#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32779#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32778#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32777#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32776#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32775#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32774#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32773#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32772#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32771#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32770#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32769#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32768#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32767#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32585#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32766#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32765#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32764#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32763#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32762#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32761#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32760#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32759#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32758#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32757#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32756#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32755#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32754#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32753#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32752#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32751#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32750#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32749#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32748#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32746#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32745#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32744#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32516#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32658#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32656#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32654#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32652#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32650#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32648#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32646#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32644#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32642#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32640#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32638#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32636#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32634#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32632#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32630#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32628#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32626#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32624#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32622#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32620#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32618#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32616#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32611#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32614#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32612#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32610#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32440#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32441#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32404#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32405#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32400#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32401#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32396#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32397#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32392#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32393#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32388#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32389#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32384#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32385#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32380#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32381#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32376#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32377#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32372#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32373#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32368#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32369#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32365#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32357#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32361#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32362#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32356#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32358#L35-2
[2024-11-08 00:18:46,058 INFO L747 eck$LassoCheckResult]: Loop: 32358#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32608#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 32409#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 32604#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 32602#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32601#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32600#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32599#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32598#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32597#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32596#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32595#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32594#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32593#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32592#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32591#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32590#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32589#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32588#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32587#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32586#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32584#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32585#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32766#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32765#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32764#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32763#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32762#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32761#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32760#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32759#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32758#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32757#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32756#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32755#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32754#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32753#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32752#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32751#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32750#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32749#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32748#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32746#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32745#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32744#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32516#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32658#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32656#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32654#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32652#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32650#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32648#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32646#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32644#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32642#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32640#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32638#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32636#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32634#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32632#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32630#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32628#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32626#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32624#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32622#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32620#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32618#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32616#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32611#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32614#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32612#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32610#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32440#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 32441#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 32404#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32405#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32400#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32401#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32396#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32397#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32392#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32393#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32388#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32389#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32384#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32385#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32380#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32381#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32376#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32377#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32372#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32373#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32368#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32369#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32365#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32357#L18 assume !(0 == __VERIFIER_assert_~cond#1); 32361#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 32362#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32356#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 32358#L35-2
[2024-11-08 00:18:46,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:46,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1116681532, now seen corresponding path program 10 times
[2024-11-08 00:18:46,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:46,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638009209]
[2024-11-08 00:18:46,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:46,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 1892 proven. 231 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked.
[2024-11-08 00:18:46,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:46,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638009209]
[2024-11-08 00:18:46,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638009209] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:46,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505046763]
[2024-11-08 00:18:46,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 00:18:46,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:46,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:46,294 INFO L229 MonitoredProcess]: Starting monitored process 77 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:18:46,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process
[2024-11-08 00:18:46,439 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 00:18:46,439 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:46,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:46,445 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 1972 proven. 204 refuted. 0 times theorem prover too weak. 1046 trivial. 0 not checked.
[2024-11-08 00:18:46,753 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 1741 proven. 435 refuted. 0 times theorem prover too weak. 1046 trivial. 0 not checked.
[2024-11-08 00:18:47,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505046763] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:47,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:47,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 28
[2024-11-08 00:18:47,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698363996]
[2024-11-08 00:18:47,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:47,003 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 00:18:47,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1740161506, now seen corresponding path program 8 times
[2024-11-08 00:18:47,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:47,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360230008]
[2024-11-08 00:18:47,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:47,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 208 proven. 626 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2024-11-08 00:18:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360230008]
[2024-11-08 00:18:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360230008] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542285026]
[2024-11-08 00:18:47,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 00:18:47,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:47,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:47,237 INFO L229 MonitoredProcess]: Starting monitored process 78 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:18:47,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process
[2024-11-08 00:18:47,316 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 00:18:47,316 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:47,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:47,320 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 208 proven. 626 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2024-11-08 00:18:47,435 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 208 proven. 626 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2024-11-08 00:18:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542285026] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:47,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:47,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16
[2024-11-08 00:18:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86051883]
[2024-11-08 00:18:47,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:47,677 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:18:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:47,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-08 00:18:47,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272
[2024-11-08 00:18:47,678 INFO L87 Difference]: Start difference. First operand 1379 states and 1463 transitions. cyclomatic complexity: 93 Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 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:18:48,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:48,088 INFO L93 Difference]: Finished difference Result 1519 states and 1586 transitions.
[2024-11-08 00:18:48,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1519 states and 1586 transitions.
[2024-11-08 00:18:48,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308
[2024-11-08 00:18:48,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1519 states to 1002 states and 1046 transitions.
[2024-11-08 00:18:48,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22
[2024-11-08 00:18:48,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22
[2024-11-08 00:18:48,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1002 states and 1046 transitions.
[2024-11-08 00:18:48,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:48,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1002 states and 1046 transitions.
[2024-11-08 00:18:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states and 1046 transitions.
[2024-11-08 00:18:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 950.
[2024-11-08 00:18:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 950 states have (on average 1.0442105263157895) internal successors, (992), 949 states have internal predecessors, (992), 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:18:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 992 transitions.
[2024-11-08 00:18:48,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 950 states and 992 transitions.
[2024-11-08 00:18:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2024-11-08 00:18:48,108 INFO L425 stractBuchiCegarLoop]: Abstraction has 950 states and 992 transitions.
[2024-11-08 00:18:48,108 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============
[2024-11-08 00:18:48,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 950 states and 992 transitions.
[2024-11-08 00:18:48,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282
[2024-11-08 00:18:48,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:48,109 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:48,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:48,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 22, 22, 4, 4, 4, 1, 1, 1]
[2024-11-08 00:18:48,112 INFO L745 eck$LassoCheckResult]: Stem: 37108#$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(9, 2);~__BLAST_NONDET~0 := 0; 37097#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 37089#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 37090#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 37094#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 37093#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 37091#L33-1 main_~i~0#1 := 0; 37092#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 37179#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 37180#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 37112#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 37113#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37537#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37536#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37535#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37534#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37533#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37532#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37531#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 37530#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 37529#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 37528#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37527#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37526#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37525#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37524#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37523#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37522#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37521#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37520#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37519#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37518#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37517#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37516#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37515#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37514#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37513#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37512#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37511#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37510#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37509#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37508#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37507#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37506#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37505#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37504#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37503#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37502#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 37501#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 37499#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 37500#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37689#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37688#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37687#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37686#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37685#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37684#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37683#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37682#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37681#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37680#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37679#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37678#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37676#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37675#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37674#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37673#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37672#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37671#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37670#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37669#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37668#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37667#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37666#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37665#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37664#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37663#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37662#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37661#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37660#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37659#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37658#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37657#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37656#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37655#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37654#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37653#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37652#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37651#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37650#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37649#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37648#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37647#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37646#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37645#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37644#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37643#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37642#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37641#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37640#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37639#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37638#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37637#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37636#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37635#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37634#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37633#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37632#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 37631#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 37630#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 37629#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37103#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37628#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37627#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37626#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37625#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37624#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37623#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37622#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37621#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37620#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37619#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37618#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37617#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37616#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37615#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37614#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37613#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37355#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37612#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37611#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37610#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37609#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37608#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37607#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37606#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37605#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37604#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37603#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37602#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37601#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37600#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37599#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37598#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37597#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37596#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37595#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37594#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37593#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37591#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37589#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37587#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37585#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37583#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37582#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37581#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37580#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37579#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37578#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37577#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37576#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37575#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37574#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37573#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37572#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37570#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37567#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37564#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37561#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37558#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37555#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37552#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37549#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37546#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37430#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37541#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37538#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37429#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37413#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37173#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37174#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37169#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37170#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37165#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37166#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37161#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37162#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37157#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37158#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37153#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37154#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37149#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37150#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37145#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37146#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37141#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37142#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37137#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37138#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37133#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37134#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37129#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37130#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37125#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37126#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37122#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37123#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37118#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37119#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37381#L35-2
[2024-11-08 00:18:48,112 INFO L747 eck$LassoCheckResult]: Loop: 37381#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37379#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 37176#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 37376#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 37373#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37371#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37370#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37369#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37368#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37367#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37366#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37365#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37364#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37363#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37362#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37361#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37360#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37359#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37358#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37357#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37356#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37354#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37355#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37612#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37611#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37610#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37609#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37608#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37607#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37606#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37605#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37604#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37603#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37602#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37601#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37600#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37599#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37598#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37597#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37596#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37595#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37594#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37593#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37591#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37589#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37587#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37585#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37583#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37582#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37581#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37580#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37579#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37578#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37577#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37576#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37575#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37574#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37573#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37572#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37570#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37567#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37564#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37561#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37558#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37555#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37552#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37549#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37546#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37430#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37541#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37538#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37429#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37413#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37173#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37174#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37169#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37170#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37165#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37166#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37161#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37162#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37157#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37158#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37153#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37154#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37149#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37150#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37145#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37146#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37141#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37142#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37137#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37138#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37133#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37134#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37129#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37130#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37125#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37126#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37122#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37123#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 37118#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37119#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 37381#L35-2
[2024-11-08 00:18:48,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:48,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1385180812, now seen corresponding path program 11 times
[2024-11-08 00:18:48,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:48,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894152731]
[2024-11-08 00:18:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:48,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:48,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:48,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:48,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2014993202, now seen corresponding path program 9 times
[2024-11-08 00:18:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:48,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199550946]
[2024-11-08 00:18:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:48,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:48,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:48,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:48,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1493911969, now seen corresponding path program 12 times
[2024-11-08 00:18:48,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:48,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854554455]
[2024-11-08 00:18:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:48,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8797 backedges. 5923 proven. 796 refuted. 0 times theorem prover too weak. 2078 trivial. 0 not checked.
[2024-11-08 00:18:48,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:48,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854554455]
[2024-11-08 00:18:48,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854554455] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:48,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158795695]
[2024-11-08 00:18:48,709 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-08 00:18:48,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:48,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:48,715 INFO L229 MonitoredProcess]: Starting monitored process 79 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:18:48,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process
[2024-11-08 00:18:48,916 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s)
[2024-11-08 00:18:48,917 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:48,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:48,925 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8797 backedges. 5961 proven. 758 refuted. 0 times theorem prover too weak. 2078 trivial. 0 not checked.
[2024-11-08 00:18:49,283 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8797 backedges. 5946 proven. 773 refuted. 0 times theorem prover too weak. 2078 trivial. 0 not checked.
[2024-11-08 00:18:49,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158795695] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:49,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:49,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21
[2024-11-08 00:18:49,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671357421]
[2024-11-08 00:18:49,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:51,280 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:51,280 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:51,281 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:51,281 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:51,281 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:18:51,281 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:51,281 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:51,281 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:51,281 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration14_Loop
[2024-11-08 00:18:51,281 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:51,281 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:51,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,387 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:51,387 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:18:51,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:51,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:51,394 INFO L229 MonitoredProcess]: Starting monitored process 80 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:18:51,396 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:51,396 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:51,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process
[2024-11-08 00:18:51,425 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:51,425 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:51,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0
[2024-11-08 00:18:51,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:51,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:51,463 INFO L229 MonitoredProcess]: Starting monitored process 81 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:18:51,468 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:51,468 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:51,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process
[2024-11-08 00:18:51,497 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:51,497 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:51,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:51,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:51,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:51,529 INFO L229 MonitoredProcess]: Starting monitored process 82 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:18:51,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process
[2024-11-08 00:18:51,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:51,535 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:51,548 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:51,549 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:51,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0
[2024-11-08 00:18:51,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:51,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:51,567 INFO L229 MonitoredProcess]: Starting monitored process 83 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:18:51,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process
[2024-11-08 00:18:51,570 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:51,570 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:51,583 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:51,583 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:51,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:51,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:51,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:51,601 INFO L229 MonitoredProcess]: Starting monitored process 84 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:18:51,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process
[2024-11-08 00:18:51,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:51,606 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:51,622 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:51,622 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:51,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0
[2024-11-08 00:18:51,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:51,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:51,643 INFO L229 MonitoredProcess]: Starting monitored process 85 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:18:51,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process
[2024-11-08 00:18:51,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:51,644 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:51,659 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:18:51,659 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:18:51,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0
[2024-11-08 00:18:51,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:51,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:51,675 INFO L229 MonitoredProcess]: Starting monitored process 86 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:18:51,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process
[2024-11-08 00:18:51,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:18:51,680 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:51,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:51,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:51,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:51,714 INFO L229 MonitoredProcess]: Starting monitored process 87 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:18:51,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process
[2024-11-08 00:18:51,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:18:51,716 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:18:51,949 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:18:51,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0
[2024-11-08 00:18:51,956 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:18:51,956 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:18:51,956 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:18:51,956 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:18:51,956 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:18:51,956 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:51,956 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:18:51,956 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:18:51,957 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration14_Loop
[2024-11-08 00:18:51,957 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:18:51,957 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:18:51,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:51,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:18:52,021 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:18:52,021 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:18:52,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:52,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:52,024 INFO L229 MonitoredProcess]: Starting monitored process 88 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:18:52,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process
[2024-11-08 00:18:52,026 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:18:52,038 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:52,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:52,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:52,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:52,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:52,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:52,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:52,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:52,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:52,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:52,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:52,056 INFO L229 MonitoredProcess]: Starting monitored process 89 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:18:52,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process
[2024-11-08 00:18:52,059 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:18:52,072 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:52,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:52,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:52,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:52,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:52,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:52,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:52,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:52,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:52,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:52,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:52,090 INFO L229 MonitoredProcess]: Starting monitored process 90 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:18:52,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process
[2024-11-08 00:18:52,092 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:18:52,104 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:52,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:52,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:52,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:52,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:52,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:52,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:52,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:52,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:52,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:52,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:52,123 INFO L229 MonitoredProcess]: Starting monitored process 91 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:18:52,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process
[2024-11-08 00:18:52,126 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:18:52,138 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:52,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:52,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:52,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:52,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:52,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:52,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:52,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:52,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:52,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:52,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:52,157 INFO L229 MonitoredProcess]: Starting monitored process 92 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:18:52,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process
[2024-11-08 00:18:52,159 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:18:52,171 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:52,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:52,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:52,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:52,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:52,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:52,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:52,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:52,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0
[2024-11-08 00:18:52,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:52,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:52,189 INFO L229 MonitoredProcess]: Starting monitored process 93 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:18:52,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process
[2024-11-08 00:18:52,191 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:18:52,202 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:52,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:52,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:52,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:52,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:52,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:52,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:52,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:18:52,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:52,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:52,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:52,224 INFO L229 MonitoredProcess]: Starting monitored process 94 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:18:52,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process
[2024-11-08 00:18:52,227 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:18:52,239 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:18:52,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:18:52,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:18:52,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:18:52,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:18:52,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:18:52,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:18:52,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:18:52,246 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:18:52,246 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:18:52,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:18:52,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:52,249 INFO L229 MonitoredProcess]: Starting monitored process 95 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:18:52,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process
[2024-11-08 00:18:52,279 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:18:52,279 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:18:52,279 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:18:52,279 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 7
Supporting invariants []
[2024-11-08 00:18:52,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0
[2024-11-08 00:18:52,294 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:18:52,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:52,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:52,388 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:52,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:52,620 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 7 proven. 352 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked.
[2024-11-08 00:18:52,983 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates
[2024-11-08 00:18:52,984 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 950 states and 992 transitions. cyclomatic complexity: 48 Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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:18:53,099 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 950 states and 992 transitions. cyclomatic complexity: 48. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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 2480 states and 2589 transitions. Complement of second has 18 states.
[2024-11-08 00:18:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states
[2024-11-08 00:18:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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:18:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions.
[2024-11-08 00:18:53,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 59 transitions. Stem has 209 letters. Loop has 103 letters.
[2024-11-08 00:18:53,101 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:53,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 59 transitions. Stem has 312 letters. Loop has 103 letters.
[2024-11-08 00:18:53,102 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:53,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 59 transitions. Stem has 209 letters. Loop has 206 letters.
[2024-11-08 00:18:53,102 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:18:53,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2480 states and 2589 transitions.
[2024-11-08 00:18:53,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 260
[2024-11-08 00:18:53,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2480 states to 1820 states and 1904 transitions.
[2024-11-08 00:18:53,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24
[2024-11-08 00:18:53,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24
[2024-11-08 00:18:53,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1820 states and 1904 transitions.
[2024-11-08 00:18:53,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:53,114 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1820 states and 1904 transitions.
[2024-11-08 00:18:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states and 1904 transitions.
[2024-11-08 00:18:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1573.
[2024-11-08 00:18:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1573 states have (on average 1.0483153210425937) internal successors, (1649), 1572 states have internal predecessors, (1649), 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:18:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1649 transitions.
[2024-11-08 00:18:53,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1573 states and 1649 transitions.
[2024-11-08 00:18:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2024-11-08 00:18:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420
[2024-11-08 00:18:53,134 INFO L87 Difference]: Start difference. First operand 1573 states and 1649 transitions. Second operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 states have internal predecessors, (99), 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:18:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:53,438 INFO L93 Difference]: Finished difference Result 1819 states and 1899 transitions.
[2024-11-08 00:18:53,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1819 states and 1899 transitions.
[2024-11-08 00:18:53,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 260
[2024-11-08 00:18:53,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1819 states to 744 states and 768 transitions.
[2024-11-08 00:18:53,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21
[2024-11-08 00:18:53,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21
[2024-11-08 00:18:53,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 744 states and 768 transitions.
[2024-11-08 00:18:53,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:53,444 INFO L218 hiAutomatonCegarLoop]: Abstraction has 744 states and 768 transitions.
[2024-11-08 00:18:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 768 transitions.
[2024-11-08 00:18:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 663.
[2024-11-08 00:18:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 663 states have (on average 1.0331825037707392) internal successors, (685), 662 states have internal predecessors, (685), 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:18:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 685 transitions.
[2024-11-08 00:18:53,451 INFO L240 hiAutomatonCegarLoop]: Abstraction has 663 states and 685 transitions.
[2024-11-08 00:18:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2024-11-08 00:18:53,452 INFO L425 stractBuchiCegarLoop]: Abstraction has 663 states and 685 transitions.
[2024-11-08 00:18:53,452 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============
[2024-11-08 00:18:53,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 663 states and 685 transitions.
[2024-11-08 00:18:53,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 257
[2024-11-08 00:18:53,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:53,453 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:53,455 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:53,455 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [31, 31, 31, 31, 5, 5, 5, 1, 1, 1]
[2024-11-08 00:18:53,455 INFO L745 eck$LassoCheckResult]: Stem: 46818#$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(9, 2);~__BLAST_NONDET~0 := 0; 46807#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 46799#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 46800#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 46804#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 46803#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 46801#L33-1 main_~i~0#1 := 0; 46802#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 46823#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 46972#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 46830#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 46831#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 46971#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46970#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46969#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46968#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46967#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 46966#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46965#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 46964#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 46963#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 46962#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 46961#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46960#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46959#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46958#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46957#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46956#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46955#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46954#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46953#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 46952#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46951#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 46950#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46949#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46948#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46947#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46946#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46945#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46944#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46943#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46942#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46941#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46940#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46939#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46938#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 46937#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46936#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 46935#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 46933#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 46934#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47376#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47374#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47372#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47370#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47368#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47366#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47364#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47362#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47360#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47358#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47356#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47354#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47351#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 47349#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47347#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47345#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47343#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47341#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47339#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47337#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47335#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47334#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47332#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47330#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47327#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47325#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47323#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47321#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47319#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47317#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47315#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47313#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 47311#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47309#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47307#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47305#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47303#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47301#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47299#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47297#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47295#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47293#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47291#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47289#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47287#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47285#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47283#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47281#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47279#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47277#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47271#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47272#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47265#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47266#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47260#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 47258#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47256#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 47254#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 47255#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 46814#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 46805#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46806#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46817#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46815#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46816#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47461#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47460#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47459#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47458#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47457#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47456#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47455#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47454#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47453#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47452#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47451#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47450#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 46821#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46822#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47447#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47446#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47445#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47444#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47443#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47442#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47441#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47440#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47439#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47438#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47437#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47436#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47435#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47434#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47433#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47432#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47431#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47430#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47429#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47427#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47425#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 47423#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47421#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47419#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47418#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47417#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47416#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47415#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47414#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47413#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47412#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47411#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47410#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47409#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47408#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47407#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47406#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47276#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47270#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47267#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47264#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47261#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47259#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47257#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47173#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47253#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47174#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47172#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 47170#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47000#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 46999#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46998#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46997#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46996#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46995#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46994#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46993#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46992#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46991#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46990#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46989#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46988#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46987#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46986#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46985#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46984#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46983#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46982#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46981#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46980#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46979#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46978#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46977#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46976#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46975#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46828#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46974#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46973#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46827#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 46829#L35-2
[2024-11-08 00:18:53,456 INFO L747 eck$LassoCheckResult]: Loop: 46829#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46824#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 46808#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 46809#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 46812#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 46813#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47190#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47189#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47188#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47187#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47186#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47185#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47184#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47183#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47182#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47181#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47180#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47179#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47178#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47177#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47176#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47175#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47168#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47171#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47169#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47167#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 47166#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47165#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47164#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47163#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47162#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47161#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47160#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47159#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47158#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47157#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47156#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47155#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47154#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47153#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47152#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47151#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47150#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47149#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47148#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47147#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47146#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47145#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47144#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47141#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47143#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47142#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47140#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 47139#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47138#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47137#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47136#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47135#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47134#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47133#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47132#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47131#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47130#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47129#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47128#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47127#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47126#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47125#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47124#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47123#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47122#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47121#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47120#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47119#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47118#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47117#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47116#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47115#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47114#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47113#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 47109#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47428#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47426#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47424#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47422#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47420#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47419#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47418#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47417#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47416#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47415#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47414#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47413#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47412#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47411#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47410#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47409#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47408#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47407#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47406#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47276#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47270#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47267#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47264#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47261#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47259#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47257#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47173#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47253#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 47174#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47172#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 47170#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47000#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 46999#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46998#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46997#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46996#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46995#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46994#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46993#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46992#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46991#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46990#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46989#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46988#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46987#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46986#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46985#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46984#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46983#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46982#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46981#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46980#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46979#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46978#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46977#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46976#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46975#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46828#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46974#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 46973#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46827#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 46829#L35-2
[2024-11-08 00:18:53,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1385180812, now seen corresponding path program 13 times
[2024-11-08 00:18:53,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586296293]
[2024-11-08 00:18:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:53,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:53,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:53,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:53,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1336796747, now seen corresponding path program 10 times
[2024-11-08 00:18:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:53,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679255764]
[2024-11-08 00:18:53,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:53,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:53,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0
[2024-11-08 00:18:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 1167 proven. 615 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked.
[2024-11-08 00:18:53,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:53,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679255764]
[2024-11-08 00:18:53,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679255764] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:53,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506050257]
[2024-11-08 00:18:53,832 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 00:18:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:53,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:53,834 INFO L229 MonitoredProcess]: Starting monitored process 96 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:18:53,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process
[2024-11-08 00:18:53,938 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 00:18:53,938 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:53,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:53,942 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 1109 proven. 479 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked.
[2024-11-08 00:18:54,241 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 1109 proven. 479 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked.
[2024-11-08 00:18:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506050257] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:54,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 31
[2024-11-08 00:18:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244618846]
[2024-11-08 00:18:54,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:54,533 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:18:54,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:54,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-11-08 00:18:54,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930
[2024-11-08 00:18:54,534 INFO L87 Difference]: Start difference. First operand 663 states and 685 transitions. cyclomatic complexity: 27 Second operand has 31 states, 31 states have (on average 3.903225806451613) internal successors, (121), 31 states have internal predecessors, (121), 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:18:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:56,372 INFO L93 Difference]: Finished difference Result 709 states and 730 transitions.
[2024-11-08 00:18:56,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 709 states and 730 transitions.
[2024-11-08 00:18:56,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 246
[2024-11-08 00:18:56,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 709 states to 705 states and 726 transitions.
[2024-11-08 00:18:56,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21
[2024-11-08 00:18:56,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23
[2024-11-08 00:18:56,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 726 transitions.
[2024-11-08 00:18:56,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:56,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 705 states and 726 transitions.
[2024-11-08 00:18:56,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 726 transitions.
[2024-11-08 00:18:56,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 632.
[2024-11-08 00:18:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 632 states have (on average 1.0268987341772151) internal successors, (649), 631 states have internal predecessors, (649), 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:18:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 649 transitions.
[2024-11-08 00:18:56,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 632 states and 649 transitions.
[2024-11-08 00:18:56,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states.
[2024-11-08 00:18:56,384 INFO L425 stractBuchiCegarLoop]: Abstraction has 632 states and 649 transitions.
[2024-11-08 00:18:56,384 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============
[2024-11-08 00:18:56,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 632 states and 649 transitions.
[2024-11-08 00:18:56,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 226
[2024-11-08 00:18:56,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:56,385 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:56,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:56,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [33, 33, 33, 33, 5, 5, 5, 1, 1, 1]
[2024-11-08 00:18:56,391 INFO L745 eck$LassoCheckResult]: Stem: 49220#$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(9, 2);~__BLAST_NONDET~0 := 0; 49207#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 49199#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 49200#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 49204#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 49203#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 49201#L33-1 main_~i~0#1 := 0; 49202#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 49389#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 49208#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 49209#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 49212#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49213#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49591#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49590#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49589#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49588#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49587#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49586#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 49210#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 49211#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 49585#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49584#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49583#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49582#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49581#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49580#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49579#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49578#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49577#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49576#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49575#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49574#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49573#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49572#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49571#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49570#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49569#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49568#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49567#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49566#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49565#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49564#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49563#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49562#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49561#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49560#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49559#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 49558#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 49556#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 49557#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49715#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49714#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49713#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49712#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49711#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49710#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49709#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49708#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49707#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49706#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49705#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49704#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49702#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49701#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49700#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49699#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49698#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49697#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49696#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49695#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49694#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49693#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49692#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49690#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49687#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49685#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49683#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49681#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49679#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49677#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49675#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49673#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49671#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49669#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49667#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49665#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49663#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49661#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49659#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49657#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49655#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49653#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49651#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49649#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49647#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49645#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49643#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49641#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49639#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49637#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49635#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49634#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49633#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49632#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49459#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49460#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49766#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 49449#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 49450#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 49225#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49802#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49797#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49798#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49793#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49794#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49789#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49790#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49785#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49786#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49781#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49782#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49777#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49778#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49773#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49774#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49769#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49770#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49807#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49806#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49805#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49804#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49803#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49801#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49799#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49800#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49795#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49796#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49791#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49792#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49787#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49788#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49783#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49784#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49779#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49780#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49775#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49776#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49771#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49772#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49767#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49768#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49829#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49828#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49827#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49826#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49825#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49824#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49823#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49822#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49821#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49820#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49819#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49818#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49817#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49816#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49815#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49814#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49813#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49812#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49811#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49810#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49809#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49808#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49626#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49629#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49627#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49625#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49624#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49623#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49622#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49621#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49620#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49619#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49618#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49617#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49616#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49615#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49614#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49613#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49612#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49611#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49610#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49609#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49608#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49607#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49606#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49605#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49604#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49603#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49602#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49601#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49600#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49599#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49598#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49595#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49597#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49596#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49594#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49236#L35-2
[2024-11-08 00:18:56,391 INFO L747 eck$LassoCheckResult]: Loop: 49236#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49226#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 49227#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 49386#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 49384#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49383#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49382#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49381#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49380#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49379#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49378#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49377#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49376#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49375#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49374#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49373#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49372#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49371#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49370#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49369#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49368#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49367#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49364#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49366#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49365#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49363#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49362#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49361#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49360#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49359#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49358#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49357#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49356#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49355#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49354#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49353#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49352#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49351#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49350#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49349#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49348#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49347#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49346#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49345#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49344#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49343#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49342#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49341#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49340#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49337#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49339#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49338#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49336#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49335#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49334#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49333#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49332#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49331#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49330#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49329#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49328#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49327#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49326#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49325#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49324#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49323#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49322#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49321#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49320#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49319#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49318#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49317#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49316#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49315#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49314#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49313#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49312#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49311#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49310#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49309#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49308#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49307#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49306#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49305#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49223#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49214#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49205#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49206#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49830#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49215#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49216#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49217#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49218#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49219#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49828#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49827#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49826#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49825#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49824#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49823#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49822#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49821#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49820#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49819#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49818#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49817#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49816#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49815#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49814#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49813#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49812#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49811#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49810#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49809#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49808#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49626#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49629#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49627#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49625#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49624#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49623#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49622#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49621#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49620#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49619#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49618#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49617#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49616#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49615#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49614#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49613#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49612#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49611#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49610#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49609#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49608#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49607#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49606#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49605#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49604#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49603#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49602#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49601#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49600#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49599#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49598#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49595#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49597#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49596#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49594#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49236#L35-2
[2024-11-08 00:18:56,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:56,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1385180812, now seen corresponding path program 14 times
[2024-11-08 00:18:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582265346]
[2024-11-08 00:18:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:56,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:56,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:56,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:56,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1120803893, now seen corresponding path program 11 times
[2024-11-08 00:18:56,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:56,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572806889]
[2024-11-08 00:18:56,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:56,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:18:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 768 proven. 1266 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked.
[2024-11-08 00:18:56,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:18:56,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572806889]
[2024-11-08 00:18:56,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572806889] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:18:56,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748540556]
[2024-11-08 00:18:56,845 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-08 00:18:56,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:18:56,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:18:56,847 INFO L229 MonitoredProcess]: Starting monitored process 97 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:18:56,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process
[2024-11-08 00:18:56,986 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s)
[2024-11-08 00:18:56,986 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:18:56,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 19 conjuncts are in the unsatisfiable core
[2024-11-08 00:18:56,991 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:18:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1267 proven. 360 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked.
[2024-11-08 00:18:57,128 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:18:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1267 proven. 360 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked.
[2024-11-08 00:18:57,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748540556] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:18:57,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:18:57,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 24
[2024-11-08 00:18:57,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763055171]
[2024-11-08 00:18:57,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:18:57,396 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:18:57,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:18:57,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-11-08 00:18:57,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600
[2024-11-08 00:18:57,397 INFO L87 Difference]: Start difference. First operand 632 states and 649 transitions. cyclomatic complexity: 22 Second operand has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 25 states have internal predecessors, (109), 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:18:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:18:58,152 INFO L93 Difference]: Finished difference Result 1105 states and 1140 transitions.
[2024-11-08 00:18:58,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1105 states and 1140 transitions.
[2024-11-08 00:18:58,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 431
[2024-11-08 00:18:58,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1105 states to 1105 states and 1140 transitions.
[2024-11-08 00:18:58,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23
[2024-11-08 00:18:58,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23
[2024-11-08 00:18:58,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1105 states and 1140 transitions.
[2024-11-08 00:18:58,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:18:58,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1105 states and 1140 transitions.
[2024-11-08 00:18:58,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states and 1140 transitions.
[2024-11-08 00:18:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 842.
[2024-11-08 00:18:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 842 states have (on average 1.0320665083135392) internal successors, (869), 841 states have internal predecessors, (869), 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:18:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 869 transitions.
[2024-11-08 00:18:58,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 842 states and 869 transitions.
[2024-11-08 00:18:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2024-11-08 00:18:58,167 INFO L425 stractBuchiCegarLoop]: Abstraction has 842 states and 869 transitions.
[2024-11-08 00:18:58,167 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============
[2024-11-08 00:18:58,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 842 states and 869 transitions.
[2024-11-08 00:18:58,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 363
[2024-11-08 00:18:58,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:18:58,169 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:18:58,171 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:18:58,171 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [35, 35, 35, 35, 5, 5, 5, 1, 1, 1]
[2024-11-08 00:18:58,171 INFO L745 eck$LassoCheckResult]: Stem: 51959#$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(9, 2);~__BLAST_NONDET~0 := 0; 51946#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 51938#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 51939#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 51943#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 51942#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 51940#L33-1 main_~i~0#1 := 0; 51941#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 51963#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 52214#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 52213#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 51951#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 51952#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52434#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52433#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52432#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52431#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52430#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52429#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 51949#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 51950#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 52428#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52427#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52426#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52425#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52424#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52423#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52422#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52421#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52420#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52419#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52418#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52417#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52416#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52415#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52414#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52413#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52412#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52411#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52410#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52409#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52408#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52407#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52406#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52405#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52404#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52403#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52402#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 52401#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 52399#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 52400#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52606#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52605#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52604#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52603#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52602#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52601#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52600#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52599#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52598#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52597#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52596#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52595#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52593#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52592#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52591#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52590#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52589#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52588#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52587#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52586#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52585#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52584#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52583#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52582#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52581#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52580#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52579#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52578#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52577#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52576#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52575#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52574#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52573#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52572#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52571#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52570#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52569#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52568#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52567#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52566#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52565#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52564#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52563#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52562#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52561#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52560#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52559#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52558#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52557#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52556#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52555#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52554#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52553#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52552#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52551#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52550#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52549#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 52276#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 52277#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 51965#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52548#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52547#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52546#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52545#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52544#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52543#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52542#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52541#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52540#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52539#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52538#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52537#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52536#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52535#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52534#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52533#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52532#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52531#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52530#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52529#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52528#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52527#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52526#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52525#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52524#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52523#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52522#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52521#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52520#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52519#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52518#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52517#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52516#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52515#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52514#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52513#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52512#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52511#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52510#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52509#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52508#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52507#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52506#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52505#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52504#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52503#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52502#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52501#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52500#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52499#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52498#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52497#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52496#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52495#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52494#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52493#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52492#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52491#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52490#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52489#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52488#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52487#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52486#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52485#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52484#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52483#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52481#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52480#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52479#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52477#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52476#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52475#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52474#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52473#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52472#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52471#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52470#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52469#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52468#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52467#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52466#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52465#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52464#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52463#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52462#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52461#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52460#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52459#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52458#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52457#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52456#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52455#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52454#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52453#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52322#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52326#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52324#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52321#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52051#L35-2
[2024-11-08 00:18:58,171 INFO L747 eck$LassoCheckResult]: Loop: 52051#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 51968#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 51947#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 51948#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 52047#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52210#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52209#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52208#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52207#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52206#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52205#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52204#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52203#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52202#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52201#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52200#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52199#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52198#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52197#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52195#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52193#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52190#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52188#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52186#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52184#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52181#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52179#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52177#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52175#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52173#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52171#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52169#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52167#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52165#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52163#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52161#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52159#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52157#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52155#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52153#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52151#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52149#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52147#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52145#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52143#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52141#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52139#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52137#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52134#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52133#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52128#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52129#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52122#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52118#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52119#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52684#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52683#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52682#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52681#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52680#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52679#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52678#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52677#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52676#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52675#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52674#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52673#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52672#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52671#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52670#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52669#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52668#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52667#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52666#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52665#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52664#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52663#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52662#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52661#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52660#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52659#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52658#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52657#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52656#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52655#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52654#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52653#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52652#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52651#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52650#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52649#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52648#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52647#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52646#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52645#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52644#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52643#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52642#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52641#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52640#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52639#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52638#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52637#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52636#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52635#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52634#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52633#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52632#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52631#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52630#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52629#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52628#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52627#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52626#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52625#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52616#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52624#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52623#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52622#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52621#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 52619#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 52617#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52614#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52612#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52610#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52609#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52608#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52607#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52478#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52477#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52476#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52475#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52474#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52473#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52472#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52471#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52470#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52469#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52468#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52467#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52466#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52465#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52464#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52463#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52462#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52461#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52460#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52459#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52458#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52457#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52456#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52455#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52454#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52453#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 52322#L18 assume !(0 == __VERIFIER_assert_~cond#1); 52326#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 52324#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 52321#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 52051#L35-2
[2024-11-08 00:18:58,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1385180812, now seen corresponding path program 15 times
[2024-11-08 00:18:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:58,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725784337]
[2024-11-08 00:18:58,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:58,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:58,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:58,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:58,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1904211307, now seen corresponding path program 12 times
[2024-11-08 00:18:58,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:58,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306071437]
[2024-11-08 00:18:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:58,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:58,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:58,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:18:58,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:18:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1687696482, now seen corresponding path program 16 times
[2024-11-08 00:18:58,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:18:58,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930053791]
[2024-11-08 00:18:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:18:58,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:18:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:58,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:18:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:18:58,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:01,463 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:01,464 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:01,464 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:01,464 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:01,464 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:19:01,464 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,464 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:01,464 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:01,464 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration17_Loop
[2024-11-08 00:19:01,464 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:01,464 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:01,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,520 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:01,520 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:19:01,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,523 INFO L229 MonitoredProcess]: Starting monitored process 98 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:01,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:01,525 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:01,540 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:01,540 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:01,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0
[2024-11-08 00:19:01,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,557 INFO L229 MonitoredProcess]: Starting monitored process 99 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:01,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,559 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:01,559 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:01,572 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:01,572 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:01,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0
[2024-11-08 00:19:01,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,590 INFO L229 MonitoredProcess]: Starting monitored process 100 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:01,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:01,593 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:01,616 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:01,616 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=6} Honda state: {ULTIMATE.start_main_~n~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:01,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0
[2024-11-08 00:19:01,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,633 INFO L229 MonitoredProcess]: Starting monitored process 101 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:01,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:01,637 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:01,650 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:01,651 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:01,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0
[2024-11-08 00:19:01,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,667 INFO L229 MonitoredProcess]: Starting monitored process 102 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:01,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:01,669 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:01,683 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:01,683 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:01,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0
[2024-11-08 00:19:01,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,715 INFO L229 MonitoredProcess]: Starting monitored process 103 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:01,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:01,717 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:01,731 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:01,732 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:01,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:01,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,749 INFO L229 MonitoredProcess]: Starting monitored process 104 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:01,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:01,751 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:01,765 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:01,765 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:01,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0
[2024-11-08 00:19:01,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,783 INFO L229 MonitoredProcess]: Starting monitored process 105 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:01,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:01,786 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:01,801 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:01,801 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=14} Honda state: {ULTIMATE.start_main_~j~0#1=14} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:01,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:01,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,817 INFO L229 MonitoredProcess]: Starting monitored process 106 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:01,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:01,820 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:01,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:01,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,851 INFO L229 MonitoredProcess]: Starting monitored process 107 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:01,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:19:01,854 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:01,869 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:19:01,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:01,884 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:01,884 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:01,884 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:01,884 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:01,884 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:19:01,884 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,884 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:01,884 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:01,884 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration17_Loop
[2024-11-08 00:19:01,884 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:01,884 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:01,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:01,938 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:01,939 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:19:01,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,941 INFO L229 MonitoredProcess]: Starting monitored process 108 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:01,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,943 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:01,955 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:01,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:01,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:01,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:01,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:01,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:01,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:01,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:01,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:01,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:01,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:01,979 INFO L229 MonitoredProcess]: Starting monitored process 109 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:01,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process
[2024-11-08 00:19:01,981 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:01,993 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:01,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:01,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:01,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:01,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:01,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:01,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:01,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:02,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:02,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:02,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:02,012 INFO L229 MonitoredProcess]: Starting monitored process 110 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:02,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process
[2024-11-08 00:19:02,015 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:02,028 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:02,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:02,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:02,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:02,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:02,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:02,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:02,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:02,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:02,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:02,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:02,047 INFO L229 MonitoredProcess]: Starting monitored process 111 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:02,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process
[2024-11-08 00:19:02,049 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:02,061 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:02,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:02,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:02,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:02,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:02,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:02,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:02,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:02,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:02,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:02,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:02,080 INFO L229 MonitoredProcess]: Starting monitored process 112 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:02,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process
[2024-11-08 00:19:02,082 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:02,095 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:02,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:02,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:02,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:02,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:02,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:02,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:02,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:02,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:02,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:02,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:02,114 INFO L229 MonitoredProcess]: Starting monitored process 113 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:02,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process
[2024-11-08 00:19:02,117 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:02,129 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:02,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:02,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:02,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:02,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:02,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:02,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:02,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:02,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0
[2024-11-08 00:19:02,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:02,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:02,148 INFO L229 MonitoredProcess]: Starting monitored process 114 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:02,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process
[2024-11-08 00:19:02,150 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:02,162 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:02,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:02,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:02,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:02,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:02,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:02,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:02,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:02,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0
[2024-11-08 00:19:02,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:02,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:02,182 INFO L229 MonitoredProcess]: Starting monitored process 115 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:02,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process
[2024-11-08 00:19:02,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:02,197 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:02,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:02,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:02,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:02,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:02,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:02,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:02,200 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:19:02,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:19:02,203 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:19:02,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:02,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:02,206 INFO L229 MonitoredProcess]: Starting monitored process 116 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:02,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process
[2024-11-08 00:19:02,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:19:02,208 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:19:02,208 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:19:02,208 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9
Supporting invariants []
[2024-11-08 00:19:02,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:02,223 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:19:02,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:02,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:02,319 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:02,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:02,577 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:02,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0
[2024-11-08 00:19:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2590 backedges. 9 proven. 703 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked.
[2024-11-08 00:19:03,253 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates
[2024-11-08 00:19:03,253 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 842 states and 869 transitions. cyclomatic complexity: 32 Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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:03,417 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 842 states and 869 transitions. cyclomatic complexity: 32. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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 2631 states and 2722 transitions. Complement of second has 20 states.
[2024-11-08 00:19:03,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states
[2024-11-08 00:19:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions.
[2024-11-08 00:19:03,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 64 transitions. Stem has 209 letters. Loop has 158 letters.
[2024-11-08 00:19:03,419 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:03,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 64 transitions. Stem has 367 letters. Loop has 158 letters.
[2024-11-08 00:19:03,421 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:03,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 64 transitions. Stem has 209 letters. Loop has 316 letters.
[2024-11-08 00:19:03,423 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:03,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2631 states and 2722 transitions.
[2024-11-08 00:19:03,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 277
[2024-11-08 00:19:03,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2631 states to 2279 states and 2360 transitions.
[2024-11-08 00:19:03,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22
[2024-11-08 00:19:03,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22
[2024-11-08 00:19:03,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2279 states and 2360 transitions.
[2024-11-08 00:19:03,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:03,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2279 states and 2360 transitions.
[2024-11-08 00:19:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states and 2360 transitions.
[2024-11-08 00:19:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1743.
[2024-11-08 00:19:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1743 states have (on average 1.036144578313253) internal successors, (1806), 1742 states have internal predecessors, (1806), 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:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 1806 transitions.
[2024-11-08 00:19:03,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1743 states and 1806 transitions.
[2024-11-08 00:19:03,462 INFO L425 stractBuchiCegarLoop]: Abstraction has 1743 states and 1806 transitions.
[2024-11-08 00:19:03,462 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============
[2024-11-08 00:19:03,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1743 states and 1806 transitions.
[2024-11-08 00:19:03,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 229
[2024-11-08 00:19:03,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:03,467 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:03,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:19:03,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [39, 39, 39, 39, 5, 5, 5, 1, 1, 1]
[2024-11-08 00:19:03,469 INFO L745 eck$LassoCheckResult]: Stem: 56582#$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(9, 2);~__BLAST_NONDET~0 := 0; 56569#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 56563#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 56564#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 56568#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 56567#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 56565#L33-1 main_~i~0#1 := 0; 56566#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 56598#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 57142#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 57140#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 57138#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 57136#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57134#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57132#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57130#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57128#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 57126#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 57124#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 57122#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 57120#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 57118#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 57116#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57114#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57112#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57110#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57107#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57104#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57101#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57098#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57095#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 57091#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 57088#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 57085#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57082#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57079#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57076#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57073#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57070#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57067#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57064#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57061#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57058#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57055#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57052#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57049#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 57046#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 57043#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 57040#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 57036#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 57033#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 57030#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57027#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57024#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57021#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57018#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57015#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57012#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57009#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57006#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57003#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57000#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56997#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56994#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 56991#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 56988#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 56985#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56982#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56978#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56974#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56969#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56965#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56961#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56958#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56954#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56951#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56948#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56946#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56944#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56942#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56940#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56938#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56936#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 56934#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 56932#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 56930#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56928#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56926#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56924#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56922#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56920#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56918#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56916#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56914#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56912#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56910#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56908#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56906#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56904#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56902#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56900#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56898#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56897#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56895#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56893#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56890#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 56888#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 56884#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 56880#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 56875#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 56871#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 56867#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56863#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56859#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56855#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56851#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56847#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56843#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56838#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56839#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57155#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57153#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57151#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57149#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56814#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56809#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56810#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56797#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 56798#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 56737#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 56735#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56733#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56731#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56729#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56727#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56724#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56722#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56720#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56718#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56716#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56714#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56712#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56710#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56708#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56706#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56704#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56702#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56700#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56698#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56696#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56694#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 56692#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 56690#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 56688#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56686#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56684#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56682#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56680#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56678#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56676#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56674#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56672#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56670#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56668#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56666#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56664#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56662#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56661#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56659#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56657#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56655#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56653#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56650#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56647#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56643#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56640#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56637#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56634#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 56632#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 56630#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 56628#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56627#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56626#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56625#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56624#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56623#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56622#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56621#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56620#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56619#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56618#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56617#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56616#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56615#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56614#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56613#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56612#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56611#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56610#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56609#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56608#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56607#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56606#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56605#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56604#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56601#L18 assume !(0 == __VERIFIER_assert_~cond#1); 56603#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 56602#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 56600#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 56599#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 56595#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 56593#L34-2
[2024-11-08 00:19:03,470 INFO L747 eck$LassoCheckResult]: Loop: 56593#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 56587#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 56576#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 56577#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57902#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57901#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57900#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57899#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57898#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57897#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57896#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57895#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57894#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57893#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57892#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57891#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57890#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57889#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57888#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57887#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57886#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57885#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57884#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57883#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57882#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57881#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57880#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57878#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 57877#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 57876#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 57875#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57874#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57873#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57872#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57871#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57870#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57869#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57868#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57867#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57866#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57865#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57864#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57863#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57862#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57861#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57860#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57859#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57858#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57857#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57856#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57855#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57854#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57853#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57852#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57851#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56764#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57848#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57846#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57843#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 57841#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 57839#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 57745#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57742#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57739#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57736#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57733#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57730#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57727#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57724#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57721#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57718#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57715#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57712#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57709#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57706#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57703#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57700#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57697#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57694#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57691#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57689#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57686#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57683#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57679#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57675#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57674#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57673#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57672#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57671#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57670#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 56726#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57669#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57668#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57667#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 57666#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 57665#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 57664#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57663#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57662#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57661#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57660#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57659#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57658#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57657#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57656#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57654#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57652#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57650#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57648#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57646#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57644#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57643#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57641#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57639#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57637#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57635#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57633#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57631#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57629#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57627#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57625#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57623#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57621#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57619#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57617#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57615#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57613#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57611#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57609#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57602#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57606#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57604#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57601#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 57599#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 57597#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 56597#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57594#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57592#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57590#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57588#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57586#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57584#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57582#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57580#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57578#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57576#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57574#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57572#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57570#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57568#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57567#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57565#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57563#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57560#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57558#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57556#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57555#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57553#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57551#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57549#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57547#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57545#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57543#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57541#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57539#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57537#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57535#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57533#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57526#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57530#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 57528#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57525#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 57524#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 56596#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 56593#L34-2
[2024-11-08 00:19:03,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:03,471 INFO L85 PathProgramCache]: Analyzing trace with hash 281103667, now seen corresponding path program 17 times
[2024-11-08 00:19:03,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:03,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124933417]
[2024-11-08 00:19:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:03,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:03,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:03,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:03,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1964743637, now seen corresponding path program 13 times
[2024-11-08 00:19:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551263703]
[2024-11-08 00:19:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3194 backedges. 45 proven. 2721 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked.
[2024-11-08 00:19:03,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551263703]
[2024-11-08 00:19:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551263703] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:19:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987414043]
[2024-11-08 00:19:03,995 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-08 00:19:03,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:19:03,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:03,999 INFO L229 MonitoredProcess]: Starting monitored process 117 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:04,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process
[2024-11-08 00:19:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:04,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 22 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:04,152 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3194 backedges. 984 proven. 1846 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2024-11-08 00:19:04,794 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:19:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3194 backedges. 984 proven. 1846 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2024-11-08 00:19:05,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987414043] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:19:05,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:19:05,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 44
[2024-11-08 00:19:05,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531504442]
[2024-11-08 00:19:05,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:19:05,419 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:19:05,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:19:05,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2024-11-08 00:19:05,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892
[2024-11-08 00:19:05,421 INFO L87 Difference]: Start difference. First operand 1743 states and 1806 transitions. cyclomatic complexity: 78 Second operand has 44 states, 44 states have (on average 3.8636363636363638) internal successors, (170), 44 states have internal predecessors, (170), 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:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:19:11,728 INFO L93 Difference]: Finished difference Result 3106 states and 3202 transitions.
[2024-11-08 00:19:11,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3106 states and 3202 transitions.
[2024-11-08 00:19:11,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 382
[2024-11-08 00:19:11,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3106 states to 2365 states and 2433 transitions.
[2024-11-08 00:19:11,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26
[2024-11-08 00:19:11,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28
[2024-11-08 00:19:11,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2365 states and 2433 transitions.
[2024-11-08 00:19:11,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:11,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2365 states and 2433 transitions.
[2024-11-08 00:19:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states and 2433 transitions.
[2024-11-08 00:19:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 1689.
[2024-11-08 00:19:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1689 states have (on average 1.0337477797513321) internal successors, (1746), 1688 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 1746 transitions.
[2024-11-08 00:19:11,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1689 states and 1746 transitions.
[2024-11-08 00:19:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states.
[2024-11-08 00:19:11,762 INFO L425 stractBuchiCegarLoop]: Abstraction has 1689 states and 1746 transitions.
[2024-11-08 00:19:11,762 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============
[2024-11-08 00:19:11,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1689 states and 1746 transitions.
[2024-11-08 00:19:11,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 311
[2024-11-08 00:19:11,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:11,765 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:11,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:19:11,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [41, 41, 41, 41, 5, 5, 5, 1, 1, 1]
[2024-11-08 00:19:11,768 INFO L745 eck$LassoCheckResult]: Stem: 62864#$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(9, 2);~__BLAST_NONDET~0 := 0; 62854#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 62846#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 62847#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 62851#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 62850#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 62848#L33-1 main_~i~0#1 := 0; 62849#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 63220#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 63218#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 63216#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 62858#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62859#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63503#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63502#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63501#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63500#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 63499#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 63498#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 63497#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 63496#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 63495#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 63494#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63493#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63492#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63491#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63490#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63489#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63488#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63487#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63486#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 63485#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 63484#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 63483#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63482#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63481#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63480#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63479#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63478#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63477#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63476#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63475#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63474#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63473#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63472#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63471#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 63470#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 63469#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 63468#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 63466#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 63465#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 63464#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63463#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63462#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63461#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63460#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63459#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63458#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63457#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63456#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63455#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63454#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63453#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63451#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 63450#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 63449#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 63448#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63447#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63446#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63445#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63444#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63443#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63442#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63441#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63440#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63439#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63438#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63437#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63436#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63435#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63434#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63433#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63432#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 63431#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 63430#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 63429#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63428#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63427#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63426#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63425#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63424#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63423#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63422#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63421#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63420#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63419#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63418#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63417#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63416#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63415#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63414#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63399#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63400#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63295#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63296#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63290#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 63287#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 63288#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 63281#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 63282#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 64087#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 64086#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64085#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64084#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64083#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64082#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64081#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64080#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64079#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64078#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64077#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64076#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64075#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64074#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64073#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64072#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64071#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64070#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 64068#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 64069#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 64215#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64214#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64213#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64212#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64211#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64210#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64209#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64208#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64207#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64206#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64205#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64204#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64203#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64202#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64201#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64200#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64199#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64198#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64197#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64196#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64195#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 64194#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 64193#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 64192#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64191#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64190#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64189#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64188#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64187#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64186#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64185#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64184#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64183#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64182#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64181#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64180#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64179#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64178#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64177#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64176#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64175#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64174#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64173#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64172#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64171#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64170#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64169#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64167#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 64166#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 64165#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 64014#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64012#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64010#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64008#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 64006#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 64004#L18 assume !(0 == __VERIFIER_assert_~cond#1); 64002#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 64000#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63998#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63996#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63994#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63992#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63990#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63988#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63986#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63984#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63981#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63978#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63975#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63972#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63512#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63510#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63508#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63506#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63504#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63407#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63411#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63409#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63406#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 63404#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62876#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 62874#L34-2
[2024-11-08 00:19:11,769 INFO L747 eck$LassoCheckResult]: Loop: 62874#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 62869#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 62870#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 63211#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63209#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63207#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63205#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63203#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63201#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63199#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63197#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63195#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63193#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63191#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63189#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63187#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63185#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63183#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63181#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63179#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63177#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63175#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63173#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63171#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63170#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63169#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63168#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63166#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 63165#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 63164#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 63163#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63162#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63161#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63160#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63159#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63158#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63157#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63156#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63155#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63154#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63153#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63152#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63151#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63150#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63149#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63148#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63147#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63146#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63145#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63144#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63143#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63142#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63141#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63140#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63139#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63137#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63136#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63134#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63132#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 63129#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 63127#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 63125#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63123#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63121#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63119#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63117#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63115#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63113#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63111#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63109#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63107#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63105#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63103#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63101#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63099#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63097#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63095#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63093#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63091#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63089#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63087#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63085#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63083#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63081#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63079#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63077#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63075#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63073#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63071#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63069#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63067#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63065#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63063#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63061#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63015#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63019#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63017#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63014#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 63012#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 63010#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 63008#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63007#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63006#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63005#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63004#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63003#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63002#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63001#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63000#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62999#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62998#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62997#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62996#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62995#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62994#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62993#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62992#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62991#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62990#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62989#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62988#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62987#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62986#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62985#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62984#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62983#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62982#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62981#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62980#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62979#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62978#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62977#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62976#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62969#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62973#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62970#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62968#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62965#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62923#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62875#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62919#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62917#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62915#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62914#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62913#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62912#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62911#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62910#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62909#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62908#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62907#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62906#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62905#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62904#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62903#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62902#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62901#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62900#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62899#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62898#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62897#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62896#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62895#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62894#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62893#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62892#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62891#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62890#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62889#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62888#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62887#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62886#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62885#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62884#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62883#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62882#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62879#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62881#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62880#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62878#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62877#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62873#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 62874#L34-2
[2024-11-08 00:19:11,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:11,770 INFO L85 PathProgramCache]: Analyzing trace with hash 281103667, now seen corresponding path program 18 times
[2024-11-08 00:19:11,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:11,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753638554]
[2024-11-08 00:19:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:11,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:11,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:11,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:11,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:11,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1621262539, now seen corresponding path program 14 times
[2024-11-08 00:19:11,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:11,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137227547]
[2024-11-08 00:19:11,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:11,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 45 proven. 2700 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked.
[2024-11-08 00:19:12,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:12,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137227547]
[2024-11-08 00:19:12,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137227547] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:19:12,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637625567]
[2024-11-08 00:19:12,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 00:19:12,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:19:12,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:12,294 INFO L229 MonitoredProcess]: Starting monitored process 118 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:12,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process
[2024-11-08 00:19:12,450 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 00:19:12,450 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:19:12,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 20 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:12,459 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 1925 proven. 697 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked.
[2024-11-08 00:19:12,921 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:19:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 1925 proven. 697 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked.
[2024-11-08 00:19:13,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637625567] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:19:13,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:19:13,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42
[2024-11-08 00:19:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996217373]
[2024-11-08 00:19:13,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:19:13,421 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:19:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:19:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-11-08 00:19:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1518, Unknown=0, NotChecked=0, Total=1722
[2024-11-08 00:19:13,422 INFO L87 Difference]: Start difference. First operand 1689 states and 1746 transitions. cyclomatic complexity: 74 Second operand has 42 states, 42 states have (on average 3.6904761904761907) internal successors, (155), 42 states have internal predecessors, (155), 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:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:19:17,332 INFO L93 Difference]: Finished difference Result 2194 states and 2234 transitions.
[2024-11-08 00:19:17,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2194 states and 2234 transitions.
[2024-11-08 00:19:17,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 481
[2024-11-08 00:19:17,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2194 states to 2194 states and 2234 transitions.
[2024-11-08 00:19:17,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31
[2024-11-08 00:19:17,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 426
[2024-11-08 00:19:17,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2194 states and 2234 transitions.
[2024-11-08 00:19:17,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:17,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2194 states and 2234 transitions.
[2024-11-08 00:19:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states and 2234 transitions.
[2024-11-08 00:19:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 1808.
[2024-11-08 00:19:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1808 states have (on average 1.0182522123893805) internal successors, (1841), 1807 states have internal predecessors, (1841), 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:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 1841 transitions.
[2024-11-08 00:19:17,381 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1808 states and 1841 transitions.
[2024-11-08 00:19:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states.
[2024-11-08 00:19:17,382 INFO L425 stractBuchiCegarLoop]: Abstraction has 1808 states and 1841 transitions.
[2024-11-08 00:19:17,386 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============
[2024-11-08 00:19:17,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1808 states and 1841 transitions.
[2024-11-08 00:19:17,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 348
[2024-11-08 00:19:17,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:17,394 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:17,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:19:17,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [44, 44, 44, 44, 5, 5, 5, 1, 1, 1]
[2024-11-08 00:19:17,396 INFO L745 eck$LassoCheckResult]: Stem: 68129#$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(9, 2);~__BLAST_NONDET~0 := 0; 68109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 68103#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 68104#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 68108#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 68107#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 68105#L33-1 main_~i~0#1 := 0; 68106#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 68867#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 68866#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 68865#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 68864#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68863#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68862#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68861#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68860#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68859#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68858#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68857#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 68856#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 68855#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 68854#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68853#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68852#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68851#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68850#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68849#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68848#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68847#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68846#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68845#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68844#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68843#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68842#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68841#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68840#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68839#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68838#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68837#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68836#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68835#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68834#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68833#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68832#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68831#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68830#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68829#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68828#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 68827#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 68825#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 68824#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68823#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68822#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68821#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68820#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68819#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68818#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68817#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68816#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68815#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68814#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68813#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68812#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68810#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68809#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68808#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68807#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68806#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68805#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68804#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68803#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68802#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68801#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68800#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68799#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68798#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68797#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68796#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68795#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68794#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68793#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68792#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68791#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68790#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68789#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68788#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68787#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68786#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68785#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68784#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68783#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68782#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68781#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68780#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68779#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68778#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68777#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68776#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68775#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68774#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68773#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68772#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68771#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68770#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68769#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68768#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68767#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68766#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 68548#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 68549#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 68765#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68764#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68763#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68762#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68761#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68760#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68759#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68758#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68757#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68756#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68755#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68754#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68753#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68752#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68751#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68750#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68749#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68748#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68746#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68747#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69615#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68123#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68124#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68121#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68110#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68111#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68126#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68127#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69611#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69609#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69607#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69605#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69603#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69601#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69599#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69597#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69595#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69593#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69591#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69589#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69587#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68130#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68131#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69303#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69301#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69299#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69297#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69295#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69293#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69291#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69289#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69287#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69285#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69284#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69282#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69280#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69276#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69274#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69272#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69270#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69269#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69268#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69266#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69264#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69262#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69260#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69258#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69255#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69253#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69251#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69249#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69248#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69247#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69246#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69245#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69244#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69243#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69242#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69241#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69240#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69239#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69238#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69237#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69236#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69235#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69234#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69233#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69232#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69231#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69230#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69229#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69228#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69227#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69226#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69225#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69224#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69223#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69222#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69117#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68868#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68135#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 68114#L34-2
[2024-11-08 00:19:17,397 INFO L747 eck$LassoCheckResult]: Loop: 68114#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 68115#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 68118#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68119#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69886#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69884#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69882#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69880#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69878#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69876#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69874#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69872#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69870#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69868#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69866#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69864#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69862#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69861#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69859#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69857#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69819#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69818#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69816#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69814#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69813#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69812#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69811#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69809#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69810#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69910#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69909#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69908#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69907#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68120#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68112#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68113#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68125#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68128#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69903#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69902#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69901#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69900#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69899#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69898#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69897#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69895#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69893#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69890#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69889#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69888#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69887#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69885#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69883#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69881#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69879#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69877#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69875#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69873#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69871#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69869#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69867#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69865#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69863#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69856#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69860#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69858#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69855#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69854#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69853#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69852#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69851#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69850#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69849#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69848#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69847#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69846#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69845#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69844#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69843#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69842#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69841#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69840#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69839#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69838#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69837#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69836#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69835#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69834#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69833#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69832#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69831#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69830#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69829#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69828#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69827#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69826#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69825#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69824#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69823#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69822#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69821#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69820#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69702#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69817#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69815#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69701#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69703#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69697#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69698#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69693#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69694#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69689#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69690#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69685#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69686#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69681#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69682#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69677#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69678#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69673#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69674#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69669#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69670#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69665#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69666#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69661#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69662#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69657#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69658#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69653#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69654#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69649#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69650#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69645#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69646#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69641#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69642#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69637#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69638#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69633#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69634#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69629#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69630#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69625#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69626#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69621#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69623#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69622#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69620#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69586#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68294#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68137#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68289#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68286#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68176#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68175#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68174#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68173#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68172#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68171#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68170#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68169#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68168#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68167#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68166#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68165#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68164#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68163#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68162#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68161#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68160#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68159#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68158#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68157#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68156#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68155#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68154#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68153#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68152#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68151#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68150#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68149#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68148#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68147#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68146#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68145#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68144#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68143#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68140#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68142#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68141#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68139#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68138#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68136#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 68114#L34-2
[2024-11-08 00:19:17,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash 281103667, now seen corresponding path program 19 times
[2024-11-08 00:19:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:17,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933432420]
[2024-11-08 00:19:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:17,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:17,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:17,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2055978363, now seen corresponding path program 15 times
[2024-11-08 00:19:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:17,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351653375]
[2024-11-08 00:19:17,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:17,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4039 backedges. 2031 proven. 1363 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked.
[2024-11-08 00:19:18,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:18,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351653375]
[2024-11-08 00:19:18,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351653375] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:19:18,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266295373]
[2024-11-08 00:19:18,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 00:19:18,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:19:18,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:18,366 INFO L229 MonitoredProcess]: Starting monitored process 119 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:18,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process
[2024-11-08 00:19:18,547 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s)
[2024-11-08 00:19:18,548 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:19:18,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:18,559 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4039 backedges. 1447 proven. 190 refuted. 0 times theorem prover too weak. 2402 trivial. 0 not checked.
[2024-11-08 00:19:19,188 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:19:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4039 backedges. 1447 proven. 190 refuted. 0 times theorem prover too weak. 2402 trivial. 0 not checked.
[2024-11-08 00:19:19,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266295373] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:19:19,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:19:19,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 15] total 53
[2024-11-08 00:19:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230660830]
[2024-11-08 00:19:19,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:19:19,909 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:19:19,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:19:19,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants.
[2024-11-08 00:19:19,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=2310, Unknown=0, NotChecked=0, Total=2756
[2024-11-08 00:19:19,910 INFO L87 Difference]: Start difference. First operand 1808 states and 1841 transitions. cyclomatic complexity: 40 Second operand has 53 states, 53 states have (on average 3.5283018867924527) internal successors, (187), 53 states have internal predecessors, (187), 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,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:19:24,003 INFO L93 Difference]: Finished difference Result 3932 states and 4188 transitions.
[2024-11-08 00:19:24,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3932 states and 4188 transitions.
[2024-11-08 00:19:24,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1460
[2024-11-08 00:19:24,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3932 states to 3700 states and 3925 transitions.
[2024-11-08 00:19:24,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308
[2024-11-08 00:19:24,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355
[2024-11-08 00:19:24,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3700 states and 3925 transitions.
[2024-11-08 00:19:24,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:24,037 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3700 states and 3925 transitions.
[2024-11-08 00:19:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states and 3925 transitions.
[2024-11-08 00:19:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 2398.
[2024-11-08 00:19:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2398 states have (on average 1.030442035029191) internal successors, (2471), 2397 states have internal predecessors, (2471), 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,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 2471 transitions.
[2024-11-08 00:19:24,066 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2398 states and 2471 transitions.
[2024-11-08 00:19:24,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states.
[2024-11-08 00:19:24,071 INFO L425 stractBuchiCegarLoop]: Abstraction has 2398 states and 2471 transitions.
[2024-11-08 00:19:24,071 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============
[2024-11-08 00:19:24,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2398 states and 2471 transitions.
[2024-11-08 00:19:24,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 635
[2024-11-08 00:19:24,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:24,075 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:24,077 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:19:24,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [45, 45, 45, 45, 5, 5, 5, 1, 1, 1]
[2024-11-08 00:19:24,078 INFO L745 eck$LassoCheckResult]: Stem: 75308#$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(9, 2);~__BLAST_NONDET~0 := 0; 75291#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 75281#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 75282#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 75286#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 75285#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 75283#L33-1 main_~i~0#1 := 0; 75284#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 75315#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 75316#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 75758#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 75757#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75756#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75755#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75754#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75753#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75752#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 75751#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75750#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 75749#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 75748#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 75747#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75746#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75744#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75742#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75740#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75738#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75736#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75734#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75732#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75730#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 75728#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75726#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75724#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75722#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75720#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75718#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75716#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75714#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75712#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75710#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75708#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75706#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75704#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75702#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75700#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 75698#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75696#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 75694#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 75691#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 75689#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75687#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75685#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75683#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75681#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75679#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75677#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75675#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75673#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75671#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75669#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75667#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75665#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75662#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 75660#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75658#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75656#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75654#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75652#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75650#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75648#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75646#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75644#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75642#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75640#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75638#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75636#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75634#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75632#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75630#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75628#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75626#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75624#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 75622#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75619#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75620#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75614#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75615#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75610#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75611#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75606#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75607#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75602#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75603#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75598#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75599#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75594#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75595#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75590#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75591#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75586#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75587#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75582#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75583#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75578#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75579#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 75574#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75575#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 75570#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 75571#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 75884#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75882#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75880#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75878#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75876#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75874#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75872#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75870#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75868#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75866#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75864#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75862#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75860#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75858#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75856#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75854#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75852#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75850#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 75847#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75844#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75843#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75842#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75841#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75840#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75839#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75838#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75837#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75836#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75835#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75834#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75833#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75832#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75831#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75830#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75829#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75828#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75827#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75826#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75825#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75824#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75823#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 75822#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75821#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75820#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75819#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75818#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75817#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75816#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75815#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75814#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75813#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75812#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75811#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75810#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75809#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75808#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75807#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75806#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75805#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75804#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75803#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75802#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75801#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75800#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75799#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75798#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75797#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75796#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 75795#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75794#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75793#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75792#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75791#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75790#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75789#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75788#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75787#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75786#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75785#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75784#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75783#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75782#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75781#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75780#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75779#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75778#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75777#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75776#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75775#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75774#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75773#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75772#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75771#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75770#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75769#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75768#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75767#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75766#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75765#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 75762#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75759#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 75318#L34-2
[2024-11-08 00:19:24,078 INFO L747 eck$LassoCheckResult]: Loop: 75318#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 75312#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 75295#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75296#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76999#L18 assume !(0 == __VERIFIER_assert_~cond#1); 77000#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76995#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76996#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76991#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76992#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76987#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76988#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76983#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76984#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76979#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76980#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76975#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76976#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76971#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76972#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76967#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76968#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76963#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76964#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76959#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76960#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76955#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76956#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 77005#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76950#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76951#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76945#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 76947#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 76941#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 76942#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76937#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76938#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76933#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76934#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76929#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76930#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76925#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76926#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76921#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76922#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76917#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76918#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76913#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76914#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76909#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76910#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76905#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76906#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76901#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76902#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76897#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76898#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76893#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76894#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76889#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76890#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76885#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76886#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76882#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76881#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76879#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76880#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 76877#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 76876#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 76875#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76874#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76873#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76872#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76871#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76870#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76869#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76868#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76867#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76866#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76865#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76864#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76863#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76862#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76861#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76860#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76859#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76858#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76857#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76856#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76855#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76854#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76853#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76852#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76851#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76850#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76849#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76848#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76847#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76846#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76845#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76844#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76843#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76842#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76841#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76840#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76838#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 76837#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 76836#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 76835#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76834#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76833#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76832#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76831#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76830#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76829#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76827#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76826#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76824#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76822#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76820#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76818#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76816#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76814#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76812#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76810#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76808#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76806#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76804#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76802#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76800#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76798#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76796#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76794#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76792#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76790#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76788#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76786#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76784#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76782#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76780#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76778#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76776#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76774#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76772#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76770#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76686#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76767#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76765#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76644#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 76642#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 76640#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 76639#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76638#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76637#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76636#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76635#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76634#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76633#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76632#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76631#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76630#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76629#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76628#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76627#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76626#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76625#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76624#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76623#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76622#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76621#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76620#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76619#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76618#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76617#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76616#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76615#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76614#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76613#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76612#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76611#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76610#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76609#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76606#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76603#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76600#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76597#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76596#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76595#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76594#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76593#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76592#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76591#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76590#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76589#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 76588#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75323#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 75320#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75317#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 75318#L34-2
[2024-11-08 00:19:24,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash 281103667, now seen corresponding path program 20 times
[2024-11-08 00:19:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:24,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018314888]
[2024-11-08 00:19:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:24,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:24,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:24,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash 121046475, now seen corresponding path program 16 times
[2024-11-08 00:19:24,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:24,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936911961]
[2024-11-08 00:19:24,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:24,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4220 backedges. 66 proven. 3268 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked.
[2024-11-08 00:19:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936911961]
[2024-11-08 00:19:24,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936911961] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:19:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560555880]
[2024-11-08 00:19:24,761 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 00:19:24,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:19:24,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:24,769 INFO L229 MonitoredProcess]: Starting monitored process 120 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,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process
[2024-11-08 00:19:24,928 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 00:19:24,928 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:19:24,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:24,934 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4220 backedges. 66 proven. 3460 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked.
[2024-11-08 00:19:25,647 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:19:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4220 backedges. 91 proven. 3435 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked.
[2024-11-08 00:19:26,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560555880] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:19:26,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:19:26,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15, 15] total 48
[2024-11-08 00:19:26,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374402736]
[2024-11-08 00:19:26,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:19:26,166 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:19:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:19:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2024-11-08 00:19:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=1975, Unknown=0, NotChecked=0, Total=2352
[2024-11-08 00:19:26,168 INFO L87 Difference]: Start difference. First operand 2398 states and 2471 transitions. cyclomatic complexity: 79 Second operand has 49 states, 48 states have (on average 4.145833333333333) internal successors, (199), 49 states have internal predecessors, (199), 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:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:19:29,742 INFO L93 Difference]: Finished difference Result 3701 states and 3856 transitions.
[2024-11-08 00:19:29,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3701 states and 3856 transitions.
[2024-11-08 00:19:29,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1936
[2024-11-08 00:19:29,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3701 states to 3701 states and 3856 transitions.
[2024-11-08 00:19:29,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350
[2024-11-08 00:19:29,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350
[2024-11-08 00:19:29,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3701 states and 3856 transitions.
[2024-11-08 00:19:29,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:29,773 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3701 states and 3856 transitions.
[2024-11-08 00:19:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states and 3856 transitions.
[2024-11-08 00:19:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 2730.
[2024-11-08 00:19:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2730 states, 2730 states have (on average 1.0333333333333334) internal successors, (2821), 2729 states have internal predecessors, (2821), 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:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 2821 transitions.
[2024-11-08 00:19:29,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2730 states and 2821 transitions.
[2024-11-08 00:19:29,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states.
[2024-11-08 00:19:29,849 INFO L425 stractBuchiCegarLoop]: Abstraction has 2730 states and 2821 transitions.
[2024-11-08 00:19:29,849 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============
[2024-11-08 00:19:29,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2730 states and 2821 transitions.
[2024-11-08 00:19:29,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 967
[2024-11-08 00:19:29,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:29,855 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:29,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:19:29,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [51, 51, 51, 51, 6, 6, 6, 1, 1, 1]
[2024-11-08 00:19:29,858 INFO L745 eck$LassoCheckResult]: Stem: 82923#$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(9, 2);~__BLAST_NONDET~0 := 0; 82910#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 82900#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 82901#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 82905#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 82904#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 82902#L33-1 main_~i~0#1 := 0; 82903#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 82940#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 83472#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 83469#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 83466#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 83463#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83460#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83457#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83454#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83451#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 83448#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 83445#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 83442#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 83439#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 83436#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 83433#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83430#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83427#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83424#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83421#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83418#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83415#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83412#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83409#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 83406#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 83403#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 83400#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83397#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83394#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83391#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83388#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83385#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83382#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83379#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83376#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83373#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83370#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83367#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83364#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 83361#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 83358#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 83355#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 83351#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 83348#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 83345#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83342#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83339#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83335#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83332#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83329#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83326#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83323#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83320#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83317#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83314#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83311#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83307#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 83304#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 83301#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 83298#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83295#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83292#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83289#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83286#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83283#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83280#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83277#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83274#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83271#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83268#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83265#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83262#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83259#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83255#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83252#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83249#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 83246#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 83243#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 83240#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83237#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83234#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83231#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83228#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83225#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83222#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83219#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83216#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83213#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83210#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83207#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83204#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83201#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83198#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83195#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83192#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83189#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83186#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83183#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83180#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 83177#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 83174#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 83171#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 83167#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 83164#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 83161#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83158#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83155#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83152#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83149#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83146#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83143#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83140#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83137#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83134#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83131#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83128#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83125#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83122#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83119#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83116#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83113#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 83108#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 83106#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 83104#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83102#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83100#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83098#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83096#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83094#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83092#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83090#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83088#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83086#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83084#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83082#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83080#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83078#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83076#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83074#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83072#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83070#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83068#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83066#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83064#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 83062#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 83060#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 83058#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83056#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83054#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83052#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83050#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83047#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83045#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83043#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83041#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83038#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83036#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83034#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83032#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83030#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83028#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83026#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83024#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83022#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83020#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83018#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83016#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83014#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83012#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 83010#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 83008#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 83006#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 83004#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 83000#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 83001#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82996#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82997#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82992#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82993#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82988#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82989#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82984#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82985#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82980#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82981#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82976#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82977#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82972#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82973#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82968#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82969#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82964#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82965#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82960#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82961#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82956#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82957#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82952#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82953#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82948#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82949#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82943#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 82941#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 82942#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 82933#L34-2
[2024-11-08 00:19:29,859 INFO L747 eck$LassoCheckResult]: Loop: 82933#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 82927#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 82928#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84966#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84965#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84964#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84963#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84962#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84961#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84960#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84959#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84958#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84957#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84956#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84955#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84954#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84953#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84952#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84951#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84950#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84949#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84948#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84947#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84946#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84945#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84944#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84943#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84941#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 84940#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84939#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84938#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84937#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84936#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84935#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84934#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84933#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84932#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84931#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84930#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84929#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84928#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84927#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84926#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84925#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84924#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84923#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84922#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84921#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84920#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84919#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84918#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84917#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84916#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84915#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84914#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84913#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84912#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84911#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84910#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 84909#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84908#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84907#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84906#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84905#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84904#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84903#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84902#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84901#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84900#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84899#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84898#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84897#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84896#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84895#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84894#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84893#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84892#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84891#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84890#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84889#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84888#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84887#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84886#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84885#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84884#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84883#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84882#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84881#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84880#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84879#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84878#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84877#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84876#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84875#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 84874#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84873#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84871#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84869#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84867#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84865#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84863#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84861#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84859#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84857#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84855#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84853#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84851#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84849#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84847#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84845#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84843#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84841#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84839#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84837#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84835#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84833#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84831#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84829#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84827#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84825#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84823#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84821#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84819#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84817#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84815#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84813#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84811#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84809#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84807#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84805#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84803#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84801#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84798#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 84796#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84794#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84792#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84790#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84788#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84786#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84784#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84782#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84780#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84778#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84776#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84774#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84772#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84770#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84768#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84766#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84764#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84762#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84760#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84758#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84756#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84754#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84752#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84750#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84748#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84746#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84744#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84742#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84740#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84738#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84736#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84734#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84732#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84730#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84728#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84726#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84724#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84722#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84679#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84677#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84675#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84673#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84670#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 84668#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84667#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84666#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84665#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84664#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84663#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84662#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84661#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84660#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84659#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84658#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84657#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84656#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84655#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84654#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84653#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84652#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84651#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84650#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84649#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84648#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84647#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84646#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84645#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84644#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84643#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84642#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84641#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84640#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84639#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84638#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84637#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84636#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84635#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84634#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84633#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84632#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84631#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84630#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84629#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84628#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84627#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84626#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84625#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84624#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 84623#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82937#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 82939#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 82932#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 82933#L34-2
[2024-11-08 00:19:29,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash 281103667, now seen corresponding path program 21 times
[2024-11-08 00:19:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:29,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764959892]
[2024-11-08 00:19:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:29,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:29,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:29,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:29,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1550070848, now seen corresponding path program 17 times
[2024-11-08 00:19:29,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:29,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116825389]
[2024-11-08 00:19:29,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:29,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:30,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:30,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:30,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash 142482638, now seen corresponding path program 22 times
[2024-11-08 00:19:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:30,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488486489]
[2024-11-08 00:19:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:30,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18332 backedges. 9267 proven. 3252 refuted. 0 times theorem prover too weak. 5813 trivial. 0 not checked.
[2024-11-08 00:19:30,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:30,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488486489]
[2024-11-08 00:19:30,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488486489] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:19:30,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482781756]
[2024-11-08 00:19:30,588 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 00:19:30,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:19:30,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:30,591 INFO L229 MonitoredProcess]: Starting monitored process 121 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:30,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process
[2024-11-08 00:19:30,850 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 00:19:30,851 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:19:30,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:30,862 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 18332 backedges. 9267 proven. 3252 refuted. 0 times theorem prover too weak. 5813 trivial. 0 not checked.
[2024-11-08 00:19:31,242 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:19:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18332 backedges. 9267 proven. 3252 refuted. 0 times theorem prover too weak. 5813 trivial. 0 not checked.
[2024-11-08 00:19:31,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482781756] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:19:31,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:19:31,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23
[2024-11-08 00:19:31,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549903056]
[2024-11-08 00:19:31,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:19:36,570 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:36,571 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:36,571 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:36,571 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:36,571 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:19:36,571 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:36,571 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:36,571 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:36,571 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration22_Loop
[2024-11-08 00:19:36,571 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:36,571 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:36,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,629 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:36,629 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:19:36,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:36,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:36,633 INFO L229 MonitoredProcess]: Starting monitored process 122 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:36,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process
[2024-11-08 00:19:36,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:36,635 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:36,649 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:36,649 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0} Honda state: {ULTIMATE.start_main_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:36,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:36,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:36,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:36,666 INFO L229 MonitoredProcess]: Starting monitored process 123 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:36,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process
[2024-11-08 00:19:36,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:36,669 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:36,683 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:36,683 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:36,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:36,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:36,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:36,700 INFO L229 MonitoredProcess]: Starting monitored process 124 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:36,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process
[2024-11-08 00:19:36,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:36,703 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:36,724 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:36,725 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=7} Honda state: {ULTIMATE.start_main_~n~0#1=7} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:36,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:36,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:36,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:36,746 INFO L229 MonitoredProcess]: Starting monitored process 125 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:36,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process
[2024-11-08 00:19:36,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:36,752 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:36,770 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:36,770 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:36,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:36,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:36,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:36,787 INFO L229 MonitoredProcess]: Starting monitored process 126 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:36,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process
[2024-11-08 00:19:36,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:36,789 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:36,804 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:36,805 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:36,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:36,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:36,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:36,828 INFO L229 MonitoredProcess]: Starting monitored process 127 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:36,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process
[2024-11-08 00:19:36,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:36,838 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:36,852 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:36,852 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:36,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:36,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:36,875 INFO L229 MonitoredProcess]: Starting monitored process 128 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:36,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process
[2024-11-08 00:19:36,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:36,887 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:36,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0
[2024-11-08 00:19:36,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:36,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:36,916 INFO L229 MonitoredProcess]: Starting monitored process 129 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:36,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process
[2024-11-08 00:19:36,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:19:36,920 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:36,935 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:19:36,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:36,954 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:36,954 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:36,954 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:36,954 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:36,954 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:19:36,954 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:36,954 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:36,954 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:36,954 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration22_Loop
[2024-11-08 00:19:36,954 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:36,954 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:36,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:36,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:37,034 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:37,034 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:19:37,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:37,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:37,040 INFO L229 MonitoredProcess]: Starting monitored process 130 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:37,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process
[2024-11-08 00:19:37,049 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:37,061 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:37,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:37,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:37,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:37,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:37,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:37,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:37,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:37,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0
[2024-11-08 00:19:37,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:37,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:37,087 INFO L229 MonitoredProcess]: Starting monitored process 131 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:37,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process
[2024-11-08 00:19:37,095 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:37,108 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:37,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:37,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:37,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:37,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:37,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:37,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:37,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:37,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0
[2024-11-08 00:19:37,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:37,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:37,131 INFO L229 MonitoredProcess]: Starting monitored process 132 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:37,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process
[2024-11-08 00:19:37,143 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:37,155 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:37,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:37,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:37,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:37,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:37,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:37,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:37,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:37,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:37,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:37,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:37,179 INFO L229 MonitoredProcess]: Starting monitored process 133 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:37,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process
[2024-11-08 00:19:37,182 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:37,193 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:37,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:37,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:37,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:37,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:37,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:37,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:37,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:37,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:37,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:37,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:37,219 INFO L229 MonitoredProcess]: Starting monitored process 134 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:37,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process
[2024-11-08 00:19:37,221 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:37,233 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:37,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:37,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:37,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:37,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:37,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:37,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:37,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:37,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0
[2024-11-08 00:19:37,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:37,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:37,254 INFO L229 MonitoredProcess]: Starting monitored process 135 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:37,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process
[2024-11-08 00:19:37,257 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:37,269 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:37,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:37,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:37,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:37,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:37,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:37,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:37,275 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:19:37,278 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:19:37,278 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:19:37,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:37,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:37,282 INFO L229 MonitoredProcess]: Starting monitored process 136 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:37,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process
[2024-11-08 00:19:37,284 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:19:37,284 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:19:37,284 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:19:37,284 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 11
Supporting invariants []
[2024-11-08 00:19:37,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:37,300 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:19:37,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:37,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:37,383 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:37,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:37,655 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:38,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0
[2024-11-08 00:19:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5457 backedges. 0 proven. 1232 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked.
[2024-11-08 00:19:39,040 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates
[2024-11-08 00:19:39,041 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2730 states and 2821 transitions. cyclomatic complexity: 98 Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:39,204 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2730 states and 2821 transitions. cyclomatic complexity: 98. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6158 states and 6375 transitions. Complement of second has 22 states.
[2024-11-08 00:19:39,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states
[2024-11-08 00:19:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions.
[2024-11-08 00:19:39,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 211 letters. Loop has 225 letters.
[2024-11-08 00:19:39,208 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:39,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 436 letters. Loop has 225 letters.
[2024-11-08 00:19:39,209 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:39,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 211 letters. Loop has 450 letters.
[2024-11-08 00:19:39,211 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:39,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6158 states and 6375 transitions.
[2024-11-08 00:19:39,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 571
[2024-11-08 00:19:39,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6158 states to 4843 states and 5028 transitions.
[2024-11-08 00:19:39,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98
[2024-11-08 00:19:39,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99
[2024-11-08 00:19:39,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4843 states and 5028 transitions.
[2024-11-08 00:19:39,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:39,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4843 states and 5028 transitions.
[2024-11-08 00:19:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4843 states and 5028 transitions.
[2024-11-08 00:19:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4843 to 3379.
[2024-11-08 00:19:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3379 states, 3379 states have (on average 1.0343296833382658) internal successors, (3495), 3378 states have internal predecessors, (3495), 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:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 3495 transitions.
[2024-11-08 00:19:39,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3379 states and 3495 transitions.
[2024-11-08 00:19:39,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:19:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-11-08 00:19:39,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506
[2024-11-08 00:19:39,306 INFO L87 Difference]: Start difference. First operand 3379 states and 3495 transitions. Second operand has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 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:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:19:40,060 INFO L93 Difference]: Finished difference Result 4651 states and 4828 transitions.
[2024-11-08 00:19:40,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4651 states and 4828 transitions.
[2024-11-08 00:19:40,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 487
[2024-11-08 00:19:40,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4651 states to 4359 states and 4534 transitions.
[2024-11-08 00:19:40,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2024-11-08 00:19:40,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2024-11-08 00:19:40,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4359 states and 4534 transitions.
[2024-11-08 00:19:40,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:40,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4359 states and 4534 transitions.
[2024-11-08 00:19:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states and 4534 transitions.
[2024-11-08 00:19:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 2961.
[2024-11-08 00:19:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2961 states, 2961 states have (on average 1.0371496116176968) internal successors, (3071), 2960 states have internal predecessors, (3071), 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:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2961 states and 3071 transitions.
[2024-11-08 00:19:40,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2961 states and 3071 transitions.
[2024-11-08 00:19:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states.
[2024-11-08 00:19:40,135 INFO L425 stractBuchiCegarLoop]: Abstraction has 2961 states and 3071 transitions.
[2024-11-08 00:19:40,135 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============
[2024-11-08 00:19:40,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2961 states and 3071 transitions.
[2024-11-08 00:19:40,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 487
[2024-11-08 00:19:40,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:40,140 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:40,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [65, 65, 65, 65, 14, 14, 14, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:19:40,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [67, 67, 67, 67, 7, 7, 7, 1, 1, 1]
[2024-11-08 00:19:40,143 INFO L745 eck$LassoCheckResult]: Stem: 103921#$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(9, 2);~__BLAST_NONDET~0 := 0; 103908#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 103902#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 103903#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 103907#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 103906#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 103904#L33-1 main_~i~0#1 := 0; 103905#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 103931#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 103911#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 103912#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 105133#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 105134#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105182#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105180#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105178#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105176#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 105174#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 105172#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 105170#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 105168#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 105166#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 105164#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105162#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105160#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105158#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105156#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105154#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105152#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105150#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105148#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 105146#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 105144#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 105141#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105140#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105139#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105138#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105137#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105136#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105135#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105132#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105131#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105130#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105129#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105127#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105128#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 105209#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 105208#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 105207#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 105206#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 105205#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 105204#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105203#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105202#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105201#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105200#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105199#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105198#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105197#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105196#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105195#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105194#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105193#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105192#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 105191#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 105190#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 105189#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105188#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105187#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105186#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105185#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105184#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105183#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105181#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105179#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105177#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105175#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105173#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105171#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105169#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105167#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105165#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105163#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 105161#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 105159#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 105157#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105155#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105153#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105151#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105149#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105147#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105145#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105142#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105143#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105220#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105219#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105218#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105217#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105216#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105215#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105214#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105213#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105212#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105211#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105210#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105126#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 105125#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 103937#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 103913#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 103914#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 103926#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 106012#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 106011#L18 assume !(0 == __VERIFIER_assert_~cond#1); 106010#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 106009#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 106008#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 106007#L18 assume !(0 == __VERIFIER_assert_~cond#1); 106006#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 106005#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 106004#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 106003#L18 assume !(0 == __VERIFIER_assert_~cond#1); 106002#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 106001#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 106000#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 105999#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 105998#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 105997#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105996#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105995#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105994#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105993#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105992#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105991#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105990#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105989#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105988#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105987#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105986#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105985#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105984#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105983#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105982#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105981#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 105980#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 105979#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 105977#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105976#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105975#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105974#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105973#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105972#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105971#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105970#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105969#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105968#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105967#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105966#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105965#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105964#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105963#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105962#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105741#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105740#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105739#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105738#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104586#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 104585#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104583#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 104388#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 104386#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 104384#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104382#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104380#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104378#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104376#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104374#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104372#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104370#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104368#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104366#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104364#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104362#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104360#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104358#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104356#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104354#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104352#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104350#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104348#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104346#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104344#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104342#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 104338#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104336#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104334#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104332#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104330#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104328#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104326#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104324#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104322#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104320#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104318#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104316#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104314#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104312#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104310#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104308#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104306#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104304#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104302#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104300#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104298#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104296#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104294#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104292#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104290#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104288#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104285#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 104283#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104281#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104279#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104277#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104275#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104273#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104271#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104269#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104267#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104265#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104263#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104261#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104259#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104257#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104255#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104253#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104251#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104249#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104247#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104245#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104243#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104241#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104239#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104237#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104235#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104233#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104231#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104229#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104227#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104225#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104223#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 104221#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104219#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104217#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104215#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104213#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104211#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104209#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104207#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104205#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104203#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104201#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104199#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104197#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104195#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104193#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104191#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104189#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104187#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104185#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104183#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104181#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104179#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104177#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104176#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104174#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104173#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104171#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104169#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104167#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104165#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104163#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104161#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104159#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104157#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104155#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 104153#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104151#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104149#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104147#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104145#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104143#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104141#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104139#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104137#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104135#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104133#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104131#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104129#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104127#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104125#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104123#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104121#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104119#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104117#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104115#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104113#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104111#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104109#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104107#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104105#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104103#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104101#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104099#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104097#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104095#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104093#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104091#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104089#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104088#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104086#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104082#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104081#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 103944#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 103928#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 103922#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 103923#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 103930#L34-2
[2024-11-08 00:19:40,144 INFO L747 eck$LassoCheckResult]: Loop: 103930#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 103925#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 103915#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 103916#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105036#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105034#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105032#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105030#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105028#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105026#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105024#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105022#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105020#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105018#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105016#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105014#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105013#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105012#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105010#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 105008#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105006#L18 assume !(0 == __VERIFIER_assert_~cond#1); 105004#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 105001#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104998#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104994#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104991#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104988#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104986#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104984#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104981#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104978#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104973#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 104970#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104967#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104964#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104961#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104958#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104955#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104952#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104949#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104946#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104943#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104940#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104937#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104934#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104931#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104928#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104925#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104922#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104919#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104916#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104913#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104910#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104907#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104904#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104901#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104898#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104895#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104892#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104889#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104886#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104883#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104880#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104877#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104875#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104872#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104869#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 104847#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104845#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104843#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104841#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104839#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104837#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104835#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104833#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104831#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104829#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104827#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104825#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104823#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104821#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104819#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104817#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104815#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104813#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104811#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104809#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104807#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104805#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104803#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104801#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104799#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104797#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104795#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104793#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104791#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104789#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104787#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104785#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104784#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104782#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104780#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104778#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104776#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104774#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104771#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 104769#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104767#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104765#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104764#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104763#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104762#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104761#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104760#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104759#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104758#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104757#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104756#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104755#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104754#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104753#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104752#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104751#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104750#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104749#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104748#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104747#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104746#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104745#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104744#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104743#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104742#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104741#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104740#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104739#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104738#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104737#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104736#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104735#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104734#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104733#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104732#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104731#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104730#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104729#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104726#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104728#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104727#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104725#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 104724#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104723#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104722#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104721#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104720#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104719#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104718#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104717#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104716#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104715#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104714#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104713#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104712#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104711#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104710#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104709#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104708#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104707#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104706#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104705#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104704#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104703#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104702#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104701#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104700#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104699#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104698#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104697#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104696#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104695#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104694#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104693#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104692#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104691#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104690#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104689#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104688#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104687#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104686#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104685#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104684#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104683#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104682#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 103936#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104681#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104680#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104679#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 104678#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104677#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104676#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104675#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104674#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104673#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104672#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104671#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104670#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104669#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104668#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104667#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104666#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104665#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104664#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104663#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104662#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104661#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104660#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104659#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104658#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104657#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104656#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104655#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104654#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104653#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104652#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104651#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104650#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104649#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104648#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104647#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104646#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104645#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104644#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104643#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104642#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104641#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104640#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104639#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104638#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104637#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104587#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104084#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104584#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104581#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104582#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 103957#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104175#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 103933#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104172#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104170#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104168#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104166#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104164#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104162#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104160#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104158#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104156#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104154#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104152#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104150#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104148#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104146#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104144#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104142#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104140#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104138#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104136#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104134#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104132#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104130#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104128#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104126#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104124#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104122#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104120#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104118#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104116#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104114#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104112#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104110#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104108#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104106#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 104104#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104102#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104100#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104098#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 103996#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 103995#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 103994#L18 assume !(0 == __VERIFIER_assert_~cond#1); 103945#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 103942#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 103943#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 103934#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 103932#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 103930#L34-2
[2024-11-08 00:19:40,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1963302338, now seen corresponding path program 23 times
[2024-11-08 00:19:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:40,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210063624]
[2024-11-08 00:19:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:40,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9627 backedges. 4782 proven. 299 refuted. 0 times theorem prover too weak. 4546 trivial. 0 not checked.
[2024-11-08 00:19:40,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:40,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210063624]
[2024-11-08 00:19:40,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210063624] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:19:40,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789939384]
[2024-11-08 00:19:40,431 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-08 00:19:40,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:19:40,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:40,434 INFO L229 MonitoredProcess]: Starting monitored process 137 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:40,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process
[2024-11-08 00:19:40,726 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s)
[2024-11-08 00:19:40,726 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:19:40,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:40,735 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9627 backedges. 4852 proven. 283 refuted. 0 times theorem prover too weak. 4492 trivial. 0 not checked.
[2024-11-08 00:19:41,000 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:19:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9627 backedges. 4948 proven. 187 refuted. 0 times theorem prover too weak. 4492 trivial. 0 not checked.
[2024-11-08 00:19:41,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789939384] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:19:41,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:19:41,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 25
[2024-11-08 00:19:41,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954872177]
[2024-11-08 00:19:41,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:19:41,177 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 00:19:41,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:41,177 INFO L85 PathProgramCache]: Analyzing trace with hash -335275221, now seen corresponding path program 18 times
[2024-11-08 00:19:41,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329566215]
[2024-11-08 00:19:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9383 backedges. 66 proven. 5940 refuted. 0 times theorem prover too weak. 3377 trivial. 0 not checked.
[2024-11-08 00:19:41,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:41,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329566215]
[2024-11-08 00:19:41,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329566215] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:19:41,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603154435]
[2024-11-08 00:19:41,919 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-08 00:19:41,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:19:41,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:41,922 INFO L229 MonitoredProcess]: Starting monitored process 138 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:41,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process
[2024-11-08 00:19:42,232 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s)
[2024-11-08 00:19:42,232 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:19:42,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 24 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:42,244 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9383 backedges. 2388 proven. 1805 refuted. 0 times theorem prover too weak. 5190 trivial. 0 not checked.
[2024-11-08 00:19:42,956 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:19:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9383 backedges. 1357 proven. 2836 refuted. 0 times theorem prover too weak. 5190 trivial. 0 not checked.
[2024-11-08 00:19:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603154435] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:19:43,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:19:43,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 55
[2024-11-08 00:19:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114793799]
[2024-11-08 00:19:43,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:19:43,585 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:19:43,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:19:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants.
[2024-11-08 00:19:43,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=2432, Unknown=0, NotChecked=0, Total=3080
[2024-11-08 00:19:43,587 INFO L87 Difference]: Start difference. First operand 2961 states and 3071 transitions. cyclomatic complexity: 116 Second operand has 56 states, 55 states have (on average 3.581818181818182) internal successors, (197), 56 states have internal predecessors, (197), 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:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:19:45,996 INFO L93 Difference]: Finished difference Result 4445 states and 4649 transitions.
[2024-11-08 00:19:45,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4445 states and 4649 transitions.
[2024-11-08 00:19:46,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1016
[2024-11-08 00:19:46,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4445 states to 4445 states and 4649 transitions.
[2024-11-08 00:19:46,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2024-11-08 00:19:46,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2024-11-08 00:19:46,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4445 states and 4649 transitions.
[2024-11-08 00:19:46,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:46,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4445 states and 4649 transitions.
[2024-11-08 00:19:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states and 4649 transitions.
[2024-11-08 00:19:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 3109.
[2024-11-08 00:19:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3109 states, 3109 states have (on average 1.040527500804117) internal successors, (3235), 3108 states have internal predecessors, (3235), 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:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 3235 transitions.
[2024-11-08 00:19:46,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3109 states and 3235 transitions.
[2024-11-08 00:19:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states.
[2024-11-08 00:19:46,093 INFO L425 stractBuchiCegarLoop]: Abstraction has 3109 states and 3235 transitions.
[2024-11-08 00:19:46,093 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============
[2024-11-08 00:19:46,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3109 states and 3235 transitions.
[2024-11-08 00:19:46,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 491
[2024-11-08 00:19:46,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:46,098 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:46,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [65, 65, 65, 65, 14, 14, 14, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:19:46,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [70, 70, 70, 70, 7, 7, 7, 1, 1, 1]
[2024-11-08 00:19:46,101 INFO L745 eck$LassoCheckResult]: Stem: 115331#$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(9, 2);~__BLAST_NONDET~0 := 0; 115320#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 115312#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 115313#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 115317#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 115316#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 115314#L33-1 main_~i~0#1 := 0; 115315#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 115343#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 115321#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 115322#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 115927#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115925#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115923#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115921#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115919#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115917#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115915#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115913#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 115911#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 115909#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 115907#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115905#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115903#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115901#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115898#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115896#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115894#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115892#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115890#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115888#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115886#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115884#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115882#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115880#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115878#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115876#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115874#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115872#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115870#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115868#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115866#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115864#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115862#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115860#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115858#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115856#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115854#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 115852#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 115850#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 115848#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115846#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115844#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115842#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115840#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115838#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115836#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115834#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115832#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115830#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115828#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115826#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115824#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115822#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115820#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115818#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115816#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115814#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115812#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115810#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115808#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115806#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115804#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115802#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115800#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115798#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115796#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115794#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115792#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115790#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115788#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115786#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115784#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115782#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115780#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115778#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115776#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115774#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115772#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115770#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115768#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115766#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115764#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115762#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115760#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115758#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115756#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115754#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115752#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115750#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115748#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115746#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115744#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115742#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115740#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115738#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115736#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115734#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 115732#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 115729#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 115727#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115725#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115723#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115721#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115719#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115717#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115715#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115713#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115711#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115709#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115707#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115705#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115703#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115701#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115699#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115697#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115694#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115692#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115690#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115688#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115686#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115684#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115682#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115680#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115678#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115676#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115674#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115672#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115670#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115668#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115666#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115664#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115662#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115660#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115658#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115655#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115653#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115651#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115649#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115647#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115645#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115643#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115641#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115639#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115637#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115635#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115633#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115631#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115629#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115627#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115625#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115623#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115621#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115619#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115618#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115562#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115561#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115560#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 115559#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 115558#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 115557#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115556#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115555#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115554#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115553#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115552#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115551#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115550#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115549#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115548#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115547#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115546#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115545#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115544#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115543#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115542#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115541#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115540#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115539#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115538#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115537#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115536#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115533#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115532#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115531#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115530#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115529#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115528#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115527#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115526#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115525#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115524#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115523#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115522#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115521#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115520#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115519#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115518#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115517#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115516#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115515#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115514#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115513#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115512#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115511#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115510#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115509#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115508#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115506#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115505#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115504#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115503#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115502#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115501#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115500#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115499#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115498#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115497#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115496#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115495#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115494#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115493#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115492#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115491#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115490#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115489#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115488#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115487#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115486#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115485#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115484#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115483#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115482#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115481#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115480#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115479#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115478#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115477#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115476#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115475#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115474#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115473#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115472#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115471#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115470#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115469#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115468#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115467#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115466#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115465#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115464#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115463#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115462#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115461#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115460#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115459#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115458#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115457#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115456#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115455#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115454#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115453#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115452#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115451#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115450#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115449#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115448#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115447#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115446#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115445#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115444#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115443#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115442#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115441#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115440#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115439#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115438#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115437#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115436#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115435#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115434#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115433#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115432#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115431#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115430#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115429#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115428#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115427#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115426#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115425#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115424#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115423#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115422#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115421#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115420#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115419#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115418#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115417#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115416#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115415#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115414#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115413#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115412#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115411#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115410#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115409#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115408#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115407#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115402#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115360#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 115358#L18 assume !(0 == __VERIFIER_assert_~cond#1); 115359#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 115401#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 115338#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 115332#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 115333#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 115340#L34-2
[2024-11-08 00:19:46,102 INFO L747 eck$LassoCheckResult]: Loop: 115340#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 115335#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 115325#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 115326#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117078#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117077#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117076#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117075#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117074#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117073#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117072#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117071#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117070#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117069#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117068#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117067#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117066#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117065#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117064#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117063#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117062#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117061#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117060#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117059#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117058#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117057#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117056#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117055#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117054#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117053#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117052#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117050#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 117049#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 117048#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 117047#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117046#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117045#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117044#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117043#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117042#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117041#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117040#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117039#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117038#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117037#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117036#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117035#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117034#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117033#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117032#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117031#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117030#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117029#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117028#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117027#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117026#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117025#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117024#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117023#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117022#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117021#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117020#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117019#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117018#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117017#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117014#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117015#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 117007#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 117006#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 117005#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117004#L18 assume !(0 == __VERIFIER_assert_~cond#1); 117003#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 117002#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117001#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117000#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116999#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116998#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116997#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116996#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116995#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116994#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116993#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116992#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116991#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116990#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116989#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116988#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116987#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116986#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116985#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116984#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116983#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116982#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116981#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116980#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116979#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116978#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116977#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116976#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116975#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116974#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116973#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116972#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116971#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116970#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116968#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 116967#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 116966#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 116964#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116963#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116962#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116961#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116960#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116959#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116958#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116957#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116956#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116955#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116954#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116953#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116952#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116951#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116950#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116949#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116948#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116947#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116946#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116945#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116944#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116943#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116942#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116941#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116940#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116939#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116938#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116937#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116936#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116935#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116934#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116933#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116932#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116931#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116930#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116929#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116928#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116925#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116927#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116926#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116924#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 116923#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 116922#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 116921#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116920#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116919#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116918#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116917#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116916#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116915#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116914#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116913#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116912#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116911#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116910#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116909#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116908#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116907#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116906#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116905#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116904#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116903#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116902#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116901#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116900#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116899#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116898#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116897#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116896#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116895#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116894#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116893#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116892#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116891#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116890#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116889#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116888#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116887#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116886#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116885#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116884#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116883#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116882#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116881#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116878#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116880#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116879#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116877#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 116177#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 116876#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 116875#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116874#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116873#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116872#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116871#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116870#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116869#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116868#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116867#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116866#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116865#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116864#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116863#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116862#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116861#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116860#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116859#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116858#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116857#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116856#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116855#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116854#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116853#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116852#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116851#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116850#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116849#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116848#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116847#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116846#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116845#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116844#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116843#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116842#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116841#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116840#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116839#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116838#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116837#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116836#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116835#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116834#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116833#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116832#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116831#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116739#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116829#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116827#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116738#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 116131#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 116265#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 116263#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116261#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116259#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116257#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116255#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116253#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116251#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116249#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116247#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116245#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116243#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116241#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116239#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116237#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116235#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116233#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116231#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116229#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116227#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116225#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116223#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116221#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116219#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116217#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116215#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116213#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116211#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116209#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116207#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116205#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116203#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116201#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116199#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116197#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116195#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116193#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116191#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116189#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116187#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116185#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116183#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116181#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116179#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116178#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116175#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116176#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116542#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116540#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116170#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116120#L18 assume !(0 == __VERIFIER_assert_~cond#1); 116121#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 116116#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116117#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 116268#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 116266#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 115340#L34-2
[2024-11-08 00:19:46,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1963302338, now seen corresponding path program 24 times
[2024-11-08 00:19:46,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:46,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588233033]
[2024-11-08 00:19:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:46,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9627 backedges. 4782 proven. 299 refuted. 0 times theorem prover too weak. 4546 trivial. 0 not checked.
[2024-11-08 00:19:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:46,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588233033]
[2024-11-08 00:19:46,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588233033] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:19:46,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431810251]
[2024-11-08 00:19:46,372 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-08 00:19:46,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:19:46,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:46,375 INFO L229 MonitoredProcess]: Starting monitored process 139 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:46,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process
[2024-11-08 00:19:46,592 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s)
[2024-11-08 00:19:46,592 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:19:46,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 19 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:46,598 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9627 backedges. 6363 proven. 379 refuted. 0 times theorem prover too weak. 2885 trivial. 0 not checked.
[2024-11-08 00:19:46,963 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:19:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9627 backedges. 6363 proven. 379 refuted. 0 times theorem prover too weak. 2885 trivial. 0 not checked.
[2024-11-08 00:19:47,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431810251] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:19:47,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:19:47,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 20] total 45
[2024-11-08 00:19:47,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843398997]
[2024-11-08 00:19:47,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:19:47,390 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 00:19:47,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:47,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2025341947, now seen corresponding path program 19 times
[2024-11-08 00:19:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:47,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518080062]
[2024-11-08 00:19:47,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:47,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:47,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:47,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace