./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i --full-output --architecture 64bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version 48c9605d
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/termination-memory-alloca/fermat-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-08 14:24:48,032 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-08 14:24:48,079 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf
[2025-02-08 14:24:48,082 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-08 14:24:48,082 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-08 14:24:48,082 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG
[2025-02-08 14:24:48,106 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-08 14:24:48,106 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-08 14:24:48,106 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-08 14:24:48,106 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-08 14:24:48,107 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-08 14:24:48,107 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2025-02-08 14:24:48,107 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-08 14:24:48,107 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2025-02-08 14:24:48,108 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2025-02-08 14:24:48,108 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2025-02-08 14:24:48,108 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-08 14:24:48,108 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-08 14:24:48,108 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2025-02-08 14:24:48,108 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-08 14:24:48,108 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-08 14:24:48,108 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-08 14:24:48,108 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-08 14:24:48,108 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-08 14:24:48,108 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-08 14:24:48,108 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2025-02-08 14:24:48,108 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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c
[2025-02-08 14:24:48,287 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 14:24:48,302 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 14:24:48,303 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 14:24:48,308 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 14:24:48,308 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 14:24:48,309 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i
[2025-02-08 14:24:49,457 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cdbb5521/10b2b408fc9442279c82667207454b75/FLAGf2abeacdb
[2025-02-08 14:24:49,733 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 14:24:49,735 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i
[2025-02-08 14:24:49,746 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cdbb5521/10b2b408fc9442279c82667207454b75/FLAGf2abeacdb
[2025-02-08 14:24:50,044 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cdbb5521/10b2b408fc9442279c82667207454b75
[2025-02-08 14:24:50,047 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 14:24:50,048 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 14:24:50,049 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 14:24:50,050 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 14:24:50,052 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 14:24:50,053 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,055 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@edbba06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50, skipping insertion in model container
[2025-02-08 14:24:50,055 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,084 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 14:24:50,273 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 14:24:50,281 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 14:24:50,312 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 14:24:50,333 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 14:24:50,334 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50 WrapperNode
[2025-02-08 14:24:50,334 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 14:24:50,335 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 14:24:50,335 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 14:24:50,335 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 14:24:50,338 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,346 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,359 INFO  L138                Inliner]: procedures = 109, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112
[2025-02-08 14:24:50,360 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 14:24:50,361 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 14:24:50,361 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 14:24:50,361 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 14:24:50,365 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,366 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,368 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,378 INFO  L175           MemorySlicer]: Split 27 memory accesses to 4 slices as follows [7, 8, 8, 4]. 30 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 9 writes are split as follows [2, 3, 3, 1].
[2025-02-08 14:24:50,380 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,380 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,383 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,387 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,388 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,388 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,389 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 14:24:50,390 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 14:24:50,390 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 14:24:50,390 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 14:24:50,391 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (1/1) ...
[2025-02-08 14:24:50,400 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:24:50,409 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:24:50,424 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)
[2025-02-08 14:24:50,432 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
[2025-02-08 14:24:50,446 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-02-08 14:24:50,446 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-02-08 14:24:50,446 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-02-08 14:24:50,446 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#3
[2025-02-08 14:24:50,446 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-02-08 14:24:50,447 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-02-08 14:24:50,447 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-02-08 14:24:50,447 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2025-02-08 14:24:50,447 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-02-08 14:24:50,447 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-02-08 14:24:50,447 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 14:24:50,447 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 14:24:50,524 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 14:24:50,525 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 14:24:50,657 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L548: call ULTIMATE.dealloc(main_#t~malloc2#1.base, main_#t~malloc2#1.offset);havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call ULTIMATE.dealloc(main_#t~malloc4#1.base, main_#t~malloc4#1.offset);havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call ULTIMATE.dealloc(main_#t~malloc5#1.base, main_#t~malloc5#1.offset);havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;
[2025-02-08 14:24:50,662 INFO  L?                        ?]: Removed 6 outVars from TransFormulas that were not future-live.
[2025-02-08 14:24:50,662 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 14:24:50,669 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 14:24:50,669 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-08 14:24:50,669 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:24:50 BoogieIcfgContainer
[2025-02-08 14:24:50,669 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 14:24:50,670 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2025-02-08 14:24:50,670 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2025-02-08 14:24:50,677 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2025-02-08 14:24:50,678 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:24:50,678 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:24:50" (1/3) ...
[2025-02-08 14:24:50,681 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47926502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:24:50, skipping insertion in model container
[2025-02-08 14:24:50,681 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:24:50,681 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:50" (2/3) ...
[2025-02-08 14:24:50,682 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47926502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:24:50, skipping insertion in model container
[2025-02-08 14:24:50,682 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:24:50,682 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:24:50" (3/3) ...
[2025-02-08 14:24:50,683 INFO  L363   chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i
[2025-02-08 14:24:50,716 INFO  L306   stractBuchiCegarLoop]: Interprodecural is true
[2025-02-08 14:24:50,716 INFO  L307   stractBuchiCegarLoop]: Hoare is None
[2025-02-08 14:24:50,717 INFO  L308   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2025-02-08 14:24:50,717 INFO  L309   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2025-02-08 14:24:50,718 INFO  L310   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2025-02-08 14:24:50,718 INFO  L311   stractBuchiCegarLoop]: Difference is false
[2025-02-08 14:24:50,718 INFO  L312   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2025-02-08 14:24:50,718 INFO  L316   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2025-02-08 14:24:50,721 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:24:50,732 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:24:50,732 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:24:50,732 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:24:50,739 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:24:50,739 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:24:50,739 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2025-02-08 14:24:50,740 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:24:50,740 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:24:50,740 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:24:50,740 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:24:50,740 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:24:50,740 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:24:50,749 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" 
[2025-02-08 14:24:50,749 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" 
[2025-02-08 14:24:50,759 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:24:50,759 INFO  L85        PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times
[2025-02-08 14:24:50,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:24:50,764 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668663865]
[2025-02-08 14:24:50,764 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:24:50,764 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:24:50,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:24:50,884 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:24:50,885 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:24:50,885 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:24:50,885 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:24:50,889 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:24:50,909 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:24:50,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:24:50,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:24:50,920 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:24:50,922 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:24:50,922 INFO  L85        PathProgramCache]: Analyzing trace with hash 118080391, now seen corresponding path program 1 times
[2025-02-08 14:24:50,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:24:50,922 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357610994]
[2025-02-08 14:24:50,922 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:24:50,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:24:50,942 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:24:50,951 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:24:50,951 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:24:50,951 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-08 14:24:50,953 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1570544702]
[2025-02-08 14:24:50,953 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:24:50,953 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:24:50,953 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:24:50,955 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:24:50,957 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-08 14:24:51,001 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:24:51,021 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:24:51,021 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:24:51,021 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:24:51,021 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:24:51,027 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:24:51,042 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:24:51,042 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:24:51,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:24:51,051 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:24:51,052 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:24:51,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -383559114, now seen corresponding path program 1 times
[2025-02-08 14:24:51,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:24:51,052 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541072789]
[2025-02-08 14:24:51,052 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:24:51,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:24:51,065 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-02-08 14:24:51,082 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-02-08 14:24:51,083 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:24:51,083 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:24:51,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:24:51,527 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:24:51,527 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541072789]
[2025-02-08 14:24:51,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541072789] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:24:51,529 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:24:51,529 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:24:51,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695882572]
[2025-02-08 14:24:51,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:25:04,339 WARN  L286               SmtUtils]: Spent 12.80s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2025-02-08 14:25:16,592 WARN  L286               SmtUtils]: Spent 12.10s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2025-02-08 14:25:16,991 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:25:17,018 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-08 14:25:17,019 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 14:25:17,021 INFO  L87              Difference]: Start difference. First operand  has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:17,069 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:25:17,070 INFO  L93              Difference]: Finished difference Result 16 states and 20 transitions.
[2025-02-08 14:25:17,071 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions.
[2025-02-08 14:25:17,072 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:17,075 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 11 states and 13 transitions.
[2025-02-08 14:25:17,076 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 11
[2025-02-08 14:25:17,076 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 11
[2025-02-08 14:25:17,076 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions.
[2025-02-08 14:25:17,076 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:25:17,076 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions.
[2025-02-08 14:25:17,083 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions.
[2025-02-08 14:25:17,089 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11.
[2025-02-08 14:25:17,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:17,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions.
[2025-02-08 14:25:17,090 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions.
[2025-02-08 14:25:17,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-08 14:25:17,092 INFO  L432   stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions.
[2025-02-08 14:25:17,092 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2025-02-08 14:25:17,092 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions.
[2025-02-08 14:25:17,093 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:17,093 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:17,093 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:17,093 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1]
[2025-02-08 14:25:17,093 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:25:17,093 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" 
[2025-02-08 14:25:17,093 INFO  L754   eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" 
[2025-02-08 14:25:17,094 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:17,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 1506394, now seen corresponding path program 1 times
[2025-02-08 14:25:17,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:17,094 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633725434]
[2025-02-08 14:25:17,094 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:17,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:17,131 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-08 14:25:17,153 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-08 14:25:17,154 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,154 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-08 14:25:17,155 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061809799]
[2025-02-08 14:25:17,155 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:17,155 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:17,155 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:17,158 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:17,160 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-08 14:25:17,198 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-08 14:25:17,233 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-08 14:25:17,233 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,233 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:17,233 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:17,245 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-08 14:25:17,250 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-08 14:25:17,250 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,250 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:17,262 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:17,263 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:17,263 INFO  L85        PathProgramCache]: Analyzing trace with hash 1346519853, now seen corresponding path program 2 times
[2025-02-08 14:25:17,263 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:17,263 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022569006]
[2025-02-08 14:25:17,263 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:25:17,263 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:17,271 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:17,274 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:17,274 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:25:17,277 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-08 14:25:17,278 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156792171]
[2025-02-08 14:25:17,278 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:25:17,279 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:17,279 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:17,281 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:17,282 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-08 14:25:17,325 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:17,347 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:17,347 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:25:17,347 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:17,347 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:17,351 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:17,361 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:17,361 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:17,368 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:17,369 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:17,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -253730636, now seen corresponding path program 1 times
[2025-02-08 14:25:17,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:17,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983716048]
[2025-02-08 14:25:17,369 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:17,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:17,380 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes.
[2025-02-08 14:25:17,387 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements.
[2025-02-08 14:25:17,388 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:17,388 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:17,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:17,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:25:17,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983716048]
[2025-02-08 14:25:17,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983716048] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:25:17,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:25:17,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 14:25:17,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711175199]
[2025-02-08 14:25:17,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:25:18,620 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:25:18,622 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 14:25:18,622 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-08 14:25:18,622 INFO  L87              Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand  has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:18,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:25:18,702 INFO  L93              Difference]: Finished difference Result 18 states and 21 transitions.
[2025-02-08 14:25:18,703 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions.
[2025-02-08 14:25:18,703 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 14
[2025-02-08 14:25:18,703 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions.
[2025-02-08 14:25:18,703 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2025-02-08 14:25:18,703 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2025-02-08 14:25:18,703 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions.
[2025-02-08 14:25:18,704 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:25:18,704 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions.
[2025-02-08 14:25:18,704 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions.
[2025-02-08 14:25:18,704 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2025-02-08 14:25:18,704 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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)
[2025-02-08 14:25:18,705 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions.
[2025-02-08 14:25:18,705 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions.
[2025-02-08 14:25:18,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-08 14:25:18,707 INFO  L432   stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions.
[2025-02-08 14:25:18,707 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2025-02-08 14:25:18,707 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions.
[2025-02-08 14:25:18,707 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 14
[2025-02-08 14:25:18,707 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:18,707 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:18,707 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1]
[2025-02-08 14:25:18,707 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:25:18,708 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" 
[2025-02-08 14:25:18,708 INFO  L754   eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" 
[2025-02-08 14:25:18,708 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:18,709 INFO  L85        PathProgramCache]: Analyzing trace with hash 1506394, now seen corresponding path program 2 times
[2025-02-08 14:25:18,709 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:18,709 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787798697]
[2025-02-08 14:25:18,709 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:25:18,709 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:18,716 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes.
[2025-02-08 14:25:18,726 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-08 14:25:18,726 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:25:18,726 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-08 14:25:18,727 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [121505263]
[2025-02-08 14:25:18,727 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:25:18,727 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:18,727 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:18,730 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:18,734 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-08 14:25:18,771 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes.
[2025-02-08 14:25:18,791 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-08 14:25:18,791 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:25:18,791 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:18,791 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:18,796 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-08 14:25:18,799 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-08 14:25:18,800 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:18,800 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:18,807 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:18,807 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:18,807 INFO  L85        PathProgramCache]: Analyzing trace with hash 1375149005, now seen corresponding path program 1 times
[2025-02-08 14:25:18,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:18,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921505938]
[2025-02-08 14:25:18,807 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:18,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:18,811 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:18,813 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:18,813 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:18,813 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-08 14:25:18,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417563649]
[2025-02-08 14:25:18,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:18,813 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:18,813 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:18,815 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:18,822 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-02-08 14:25:18,859 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:18,866 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:18,867 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:18,867 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:18,867 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:18,872 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:18,887 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:18,887 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:18,887 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:18,894 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:18,895 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:18,895 INFO  L85        PathProgramCache]: Analyzing trace with hash -225101484, now seen corresponding path program 1 times
[2025-02-08 14:25:18,895 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:18,895 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014771320]
[2025-02-08 14:25:18,895 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:18,895 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:18,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes.
[2025-02-08 14:25:18,916 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements.
[2025-02-08 14:25:18,916 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:18,916 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-08 14:25:18,917 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358540884]
[2025-02-08 14:25:18,917 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:18,917 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:18,917 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:18,922 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:18,923 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-02-08 14:25:18,969 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes.
[2025-02-08 14:25:18,996 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements.
[2025-02-08 14:25:18,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:18,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:18,996 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:19,005 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes.
[2025-02-08 14:25:19,016 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements.
[2025-02-08 14:25:19,016 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:19,016 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:19,031 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:21,571 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-08 14:25:21,571 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-08 14:25:21,571 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-08 14:25:21,571 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-08 14:25:21,572 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-08 14:25:21,572 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:21,572 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-08 14:25:21,572 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-08 14:25:21,572 INFO  L132   ssoRankerPreferences]: Filename of dumped script: fermat-alloca.i_Iteration3_Lasso
[2025-02-08 14:25:21,572 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-08 14:25:21,572 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-08 14:25:21,584 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:21,594 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:21,595 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:21,599 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:21,607 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:21,608 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:21,609 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:21,614 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:21,626 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:21,628 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:21,630 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,340 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,342 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,343 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,345 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,347 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,362 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,364 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,366 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,369 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,371 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,372 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,374 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,375 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,378 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:22,380 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-08 14:25:23,014 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-08 14:25:23,019 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-08 14:25:23,020 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,020 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,023 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)
[2025-02-08 14:25:23,024 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
[2025-02-08 14:25:23,025 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
[2025-02-08 14:25:23,036 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:23,036 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-08 14:25:23,037 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:23,037 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:23,037 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:23,042 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-08 14:25:23,042 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-08 14:25:23,044 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:23,049 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
[2025-02-08 14:25:23,050 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,050 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,052 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)
[2025-02-08 14:25:23,053 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
[2025-02-08 14:25:23,054 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
[2025-02-08 14:25:23,064 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:23,065 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-08 14:25:23,065 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:23,065 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:23,065 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:23,065 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-08 14:25:23,065 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-08 14:25:23,067 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:23,072 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
[2025-02-08 14:25:23,072 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,073 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,075 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)
[2025-02-08 14:25:23,076 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
[2025-02-08 14:25:23,077 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
[2025-02-08 14:25:23,087 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:23,088 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-08 14:25:23,088 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:23,088 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:23,088 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:23,090 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-08 14:25:23,090 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-08 14:25:23,094 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:23,100 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0
[2025-02-08 14:25:23,100 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,101 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,104 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)
[2025-02-08 14:25:23,105 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
[2025-02-08 14:25:23,106 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
[2025-02-08 14:25:23,115 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:23,116 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-08 14:25:23,116 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:23,116 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:23,116 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:23,117 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-08 14:25:23,118 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-08 14:25:23,120 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:23,129 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
[2025-02-08 14:25:23,129 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,129 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,133 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)
[2025-02-08 14:25:23,134 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
[2025-02-08 14:25:23,135 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
[2025-02-08 14:25:23,146 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:23,146 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-08 14:25:23,146 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:23,146 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:23,146 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:23,147 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-08 14:25:23,147 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-08 14:25:23,149 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:23,158 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
[2025-02-08 14:25:23,158 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,159 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,163 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)
[2025-02-08 14:25:23,165 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
[2025-02-08 14:25:23,166 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
[2025-02-08 14:25:23,176 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:23,176 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-08 14:25:23,176 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:23,176 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:23,176 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:23,178 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-08 14:25:23,178 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-08 14:25:23,179 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:23,187 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
[2025-02-08 14:25:23,187 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,187 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,189 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)
[2025-02-08 14:25:23,192 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
[2025-02-08 14:25:23,193 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
[2025-02-08 14:25:23,203 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:23,203 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-08 14:25:23,203 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:23,203 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:23,203 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:23,204 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-08 14:25:23,204 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-08 14:25:23,205 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:23,212 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
[2025-02-08 14:25:23,212 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,212 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,214 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)
[2025-02-08 14:25:23,216 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
[2025-02-08 14:25:23,217 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
[2025-02-08 14:25:23,227 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:23,227 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:23,227 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:23,227 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:23,231 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-08 14:25:23,231 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-08 14:25:23,240 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:23,250 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
[2025-02-08 14:25:23,250 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,251 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,252 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)
[2025-02-08 14:25:23,258 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
[2025-02-08 14:25:23,261 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
[2025-02-08 14:25:23,268 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:23,268 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-08 14:25:23,268 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:23,268 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:23,268 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:23,269 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-08 14:25:23,269 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-08 14:25:23,271 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:23,280 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
[2025-02-08 14:25:23,280 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,280 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,285 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)
[2025-02-08 14:25:23,288 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
[2025-02-08 14:25:23,289 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
[2025-02-08 14:25:23,299 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:23,299 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-08 14:25:23,299 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:23,299 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-08 14:25:23,299 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:23,299 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-08 14:25:23,300 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-08 14:25:23,303 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-08 14:25:23,312 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0
[2025-02-08 14:25:23,312 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,312 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,320 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)
[2025-02-08 14:25:23,320 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
[2025-02-08 14:25:23,322 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
[2025-02-08 14:25:23,332 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-08 14:25:23,333 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-08 14:25:23,333 INFO  L204   nArgumentSynthesizer]: 2 loop disjuncts
[2025-02-08 14:25:23,333 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-08 14:25:23,351 INFO  L401   nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications.
[2025-02-08 14:25:23,351 INFO  L402   nArgumentSynthesizer]: A total of 4 supporting invariants were added.
[2025-02-08 14:25:23,370 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-08 14:25:23,431 INFO  L443   ModelExtractionUtils]: Simplification made 15 calls to the SMT solver.
[2025-02-08 14:25:23,433 INFO  L444   ModelExtractionUtils]: 0 out of 31 variables were initially zero. Simplification set additionally 28 variables to zero.
[2025-02-08 14:25:23,434 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:25:23,434 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:23,436 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)
[2025-02-08 14:25:23,442 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
[2025-02-08 14:25:23,442 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-08 14:25:23,455 INFO  L438   nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4.
[2025-02-08 14:25:23,455 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-08 14:25:23,456 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#3 ULTIMATE.start_main_~MAX~0#1.base) ULTIMATE.start_main_~MAX~0#1.offset)_1, v_rep(select (select #memory_int#2 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1) = 1*v_rep(select (select #memory_int#3 ULTIMATE.start_main_~MAX~0#1.base) ULTIMATE.start_main_~MAX~0#1.offset)_1 - 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1
Supporting invariants []
[2025-02-08 14:25:23,464 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
[2025-02-08 14:25:23,645 INFO  L156   tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed
[2025-02-08 14:25:23,649 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3
[2025-02-08 14:25:23,650 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL]
[2025-02-08 14:25:23,650 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~MAX~0!base,<LOCAL,main>]]]
[2025-02-08 14:25:23,651 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2
[2025-02-08 14:25:23,651 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL]
[2025-02-08 14:25:23,651 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~a~0!base,<LOCAL,main>]]]
[2025-02-08 14:25:23,667 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:23,676 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-08 14:25:23,690 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-08 14:25:23,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:23,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:23,691 INFO  L256         TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:23,692 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:23,703 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:23,711 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:23,711 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:23,711 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:23,712 INFO  L256         TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:23,712 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:23,747 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19
[2025-02-08 14:25:23,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:23,803 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 
[2025-02-08 14:25:23,804 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand  has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:23,858 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand  has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 29 transitions. Complement of second has 7 states.
[2025-02-08 14:25:23,859 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 
[2025-02-08 14:25:23,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:23,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions.
[2025-02-08 14:25:23,862 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 7 letters.
[2025-02-08 14:25:23,862 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:23,862 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 7 letters.
[2025-02-08 14:25:23,862 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:23,862 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 14 letters.
[2025-02-08 14:25:23,862 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-08 14:25:23,862 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions.
[2025-02-08 14:25:23,863 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:23,863 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 29 transitions.
[2025-02-08 14:25:23,863 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 17
[2025-02-08 14:25:23,863 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2025-02-08 14:25:23,863 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions.
[2025-02-08 14:25:23,863 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-08 14:25:23,863 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions.
[2025-02-08 14:25:23,863 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions.
[2025-02-08 14:25:23,864 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2025-02-08 14:25:23,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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)
[2025-02-08 14:25:23,864 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions.
[2025-02-08 14:25:23,864 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions.
[2025-02-08 14:25:23,865 INFO  L432   stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions.
[2025-02-08 14:25:23,865 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2025-02-08 14:25:23,865 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions.
[2025-02-08 14:25:23,865 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:23,865 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:23,865 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:23,865 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:25:23,865 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:25:23,865 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" 
[2025-02-08 14:25:23,865 INFO  L754   eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" 
[2025-02-08 14:25:23,866 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:23,866 INFO  L85        PathProgramCache]: Analyzing trace with hash -225101485, now seen corresponding path program 1 times
[2025-02-08 14:25:23,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:23,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667258096]
[2025-02-08 14:25:23,866 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:23,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:23,877 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes.
[2025-02-08 14:25:23,886 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements.
[2025-02-08 14:25:23,886 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:23,886 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:23,968 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0
[2025-02-08 14:25:24,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:24,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:25:24,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667258096]
[2025-02-08 14:25:24,195 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667258096] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 14:25:24,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806534660]
[2025-02-08 14:25:24,195 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:25:24,195 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:24,195 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:24,199 INFO  L229       MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:24,201 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process
[2025-02-08 14:25:24,247 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes.
[2025-02-08 14:25:24,266 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements.
[2025-02-08 14:25:24,266 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:24,266 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:24,267 INFO  L256         TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:24,268 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:24,282 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-02-08 14:25:24,285 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-02-08 14:25:24,319 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:24,392 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2025-02-08 14:25:24,397 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2025-02-08 14:25:24,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:24,408 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-08 14:25:24,472 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:24,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806534660] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-08 14:25:24,473 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-08 14:25:24,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10
[2025-02-08 14:25:24,473 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678828652]
[2025-02-08 14:25:24,473 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-08 14:25:24,473 INFO  L757   eck$LassoCheckResult]: stem already infeasible
[2025-02-08 14:25:24,473 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:24,473 INFO  L85        PathProgramCache]: Analyzing trace with hash 1346519853, now seen corresponding path program 3 times
[2025-02-08 14:25:24,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:24,473 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606600796]
[2025-02-08 14:25:24,473 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-08 14:25:24,473 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:24,479 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:24,483 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:24,483 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-08 14:25:24,483 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-08 14:25:24,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853098003]
[2025-02-08 14:25:24,483 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-08 14:25:24,483 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:24,483 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:24,485 INFO  L229       MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:24,488 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process
[2025-02-08 14:25:24,526 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:24,549 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:24,550 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-08 14:25:24,550 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:24,550 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:24,574 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:24,582 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:24,582 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:24,582 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:24,590 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:25,483 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:25:25,483 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-02-08 14:25:25,483 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132
[2025-02-08 14:25:25,483 INFO  L87              Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 6 Second operand  has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 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)
[2025-02-08 14:25:25,629 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:25:25,629 INFO  L93              Difference]: Finished difference Result 63 states and 66 transitions.
[2025-02-08 14:25:25,629 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 66 transitions.
[2025-02-08 14:25:25,630 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:25,630 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 45 states and 48 transitions.
[2025-02-08 14:25:25,631 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2025-02-08 14:25:25,631 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2025-02-08 14:25:25,631 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 45 states and 48 transitions.
[2025-02-08 14:25:25,631 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-08 14:25:25,631 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 45 states and 48 transitions.
[2025-02-08 14:25:25,631 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states and 48 transitions.
[2025-02-08 14:25:25,632 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39.
[2025-02-08 14:25:25,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:25,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions.
[2025-02-08 14:25:25,632 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 39 states and 42 transitions.
[2025-02-08 14:25:25,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-08 14:25:25,634 INFO  L432   stractBuchiCegarLoop]: Abstraction has 39 states and 42 transitions.
[2025-02-08 14:25:25,634 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2025-02-08 14:25:25,634 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions.
[2025-02-08 14:25:25,635 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:25,635 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:25,635 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:25,635 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 1, 1]
[2025-02-08 14:25:25,635 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:25:25,635 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" 
[2025-02-08 14:25:25,635 INFO  L754   eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" 
[2025-02-08 14:25:25,635 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:25,636 INFO  L85        PathProgramCache]: Analyzing trace with hash -662449703, now seen corresponding path program 2 times
[2025-02-08 14:25:25,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:25,636 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915757382]
[2025-02-08 14:25:25,636 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:25:25,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:25,647 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes.
[2025-02-08 14:25:25,659 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:25:25,660 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-08 14:25:25,660 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:26,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:26,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:25:26,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915757382]
[2025-02-08 14:25:26,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915757382] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 14:25:26,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624924294]
[2025-02-08 14:25:26,241 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:25:26,241 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:26,241 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:26,243 INFO  L229       MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:26,248 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process
[2025-02-08 14:25:26,300 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes.
[2025-02-08 14:25:26,346 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:25:26,346 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-08 14:25:26,347 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:26,348 INFO  L256         TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:26,352 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:26,365 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-02-08 14:25:26,371 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-02-08 14:25:26,406 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:26,464 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:26,567 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:26,623 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:26,692 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2025-02-08 14:25:26,696 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2025-02-08 14:25:26,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:26,714 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-08 14:25:26,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:26,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [624924294] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-08 14:25:26,963 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-08 14:25:26,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20
[2025-02-08 14:25:26,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414406495]
[2025-02-08 14:25:26,963 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-08 14:25:26,963 INFO  L757   eck$LassoCheckResult]: stem already infeasible
[2025-02-08 14:25:26,964 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:26,964 INFO  L85        PathProgramCache]: Analyzing trace with hash 1346519853, now seen corresponding path program 4 times
[2025-02-08 14:25:26,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:26,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096903017]
[2025-02-08 14:25:26,964 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-08 14:25:26,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:26,969 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes.
[2025-02-08 14:25:26,972 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:26,972 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-08 14:25:26,972 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-08 14:25:26,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951012991]
[2025-02-08 14:25:26,973 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-08 14:25:26,973 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:26,973 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:26,979 INFO  L229       MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:26,979 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process
[2025-02-08 14:25:27,022 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes.
[2025-02-08 14:25:27,049 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:27,049 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-08 14:25:27,049 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:27,049 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:27,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:27,063 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:27,063 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:27,063 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:27,069 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:27,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:25:27,928 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-02-08 14:25:27,928 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462
[2025-02-08 14:25:27,929 INFO  L87              Difference]: Start difference. First operand 39 states and 42 transitions. cyclomatic complexity: 5 Second operand  has 22 states, 21 states have (on average 4.571428571428571) internal successors, (96), 21 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:28,252 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:25:28,253 INFO  L93              Difference]: Finished difference Result 123 states and 126 transitions.
[2025-02-08 14:25:28,253 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 126 transitions.
[2025-02-08 14:25:28,254 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:28,255 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 87 states and 90 transitions.
[2025-02-08 14:25:28,255 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2025-02-08 14:25:28,255 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2025-02-08 14:25:28,255 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 87 states and 90 transitions.
[2025-02-08 14:25:28,255 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-08 14:25:28,255 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 87 states and 90 transitions.
[2025-02-08 14:25:28,255 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87 states and 90 transitions.
[2025-02-08 14:25:28,257 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81.
[2025-02-08 14:25:28,258 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81 states, 81 states have (on average 1.037037037037037) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:28,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions.
[2025-02-08 14:25:28,258 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 81 states and 84 transitions.
[2025-02-08 14:25:28,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2025-02-08 14:25:28,259 INFO  L432   stractBuchiCegarLoop]: Abstraction has 81 states and 84 transitions.
[2025-02-08 14:25:28,259 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2025-02-08 14:25:28,259 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 84 transitions.
[2025-02-08 14:25:28,260 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:28,260 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:28,260 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:28,261 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 1, 1]
[2025-02-08 14:25:28,261 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:25:28,262 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" 
[2025-02-08 14:25:28,262 INFO  L754   eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" 
[2025-02-08 14:25:28,262 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:28,262 INFO  L85        PathProgramCache]: Analyzing trace with hash -627803623, now seen corresponding path program 3 times
[2025-02-08 14:25:28,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:28,262 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454425399]
[2025-02-08 14:25:28,262 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-08 14:25:28,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:28,280 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 11 equivalence classes.
[2025-02-08 14:25:28,317 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 74 of 74 statements.
[2025-02-08 14:25:28,317 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2025-02-08 14:25:28,317 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:29,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:29,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:25:29,833 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454425399]
[2025-02-08 14:25:29,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454425399] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 14:25:29,833 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699712590]
[2025-02-08 14:25:29,833 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-08 14:25:29,833 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:29,834 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:29,835 INFO  L229       MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:29,841 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process
[2025-02-08 14:25:29,909 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 11 equivalence classes.
[2025-02-08 14:25:31,011 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 74 of 74 statements.
[2025-02-08 14:25:31,011 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2025-02-08 14:25:31,011 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:31,015 INFO  L256         TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 42 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:31,024 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:31,037 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-02-08 14:25:31,042 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-02-08 14:25:31,066 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:31,117 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:31,174 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:31,248 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:31,300 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:31,385 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:31,455 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:31,533 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:31,621 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:31,701 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:31,768 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2025-02-08 14:25:31,780 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2025-02-08 14:25:31,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:31,800 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-08 14:25:32,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:32,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [699712590] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-08 14:25:32,337 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-08 14:25:32,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 37
[2025-02-08 14:25:32,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546007718]
[2025-02-08 14:25:32,337 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-08 14:25:32,338 INFO  L757   eck$LassoCheckResult]: stem already infeasible
[2025-02-08 14:25:32,338 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:32,338 INFO  L85        PathProgramCache]: Analyzing trace with hash 1346519853, now seen corresponding path program 5 times
[2025-02-08 14:25:32,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:32,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405033944]
[2025-02-08 14:25:32,339 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-08 14:25:32,340 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:32,345 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:32,348 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:32,348 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:25:32,348 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-08 14:25:32,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503963274]
[2025-02-08 14:25:32,348 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-08 14:25:32,349 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:32,349 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:32,350 INFO  L229       MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:32,353 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process
[2025-02-08 14:25:32,399 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:32,410 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:32,410 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:25:32,410 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:32,410 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:32,413 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:32,425 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:32,425 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:32,425 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:32,431 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:33,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:25:33,142 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2025-02-08 14:25:33,143 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=900, Unknown=0, NotChecked=0, Total=1482
[2025-02-08 14:25:33,143 INFO  L87              Difference]: Start difference. First operand 81 states and 84 transitions. cyclomatic complexity: 5 Second operand  has 39 states, 38 states have (on average 5.842105263157895) internal successors, (222), 38 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:33,908 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:25:33,908 INFO  L93              Difference]: Finished difference Result 243 states and 246 transitions.
[2025-02-08 14:25:33,908 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 246 transitions.
[2025-02-08 14:25:33,910 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:33,911 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 171 states and 174 transitions.
[2025-02-08 14:25:33,911 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2025-02-08 14:25:33,911 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2025-02-08 14:25:33,911 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 171 states and 174 transitions.
[2025-02-08 14:25:33,911 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-08 14:25:33,911 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 171 states and 174 transitions.
[2025-02-08 14:25:33,911 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171 states and 174 transitions.
[2025-02-08 14:25:33,920 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 165.
[2025-02-08 14:25:33,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 165 states, 165 states have (on average 1.018181818181818) internal successors, (168), 164 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:33,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions.
[2025-02-08 14:25:33,921 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 165 states and 168 transitions.
[2025-02-08 14:25:33,921 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. 
[2025-02-08 14:25:33,921 INFO  L432   stractBuchiCegarLoop]: Abstraction has 165 states and 168 transitions.
[2025-02-08 14:25:33,922 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2025-02-08 14:25:33,922 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 168 transitions.
[2025-02-08 14:25:33,923 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:33,923 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:33,923 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:33,926 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 22, 22, 22, 22, 22, 1, 1]
[2025-02-08 14:25:33,926 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:25:33,926 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" 
[2025-02-08 14:25:33,926 INFO  L754   eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" 
[2025-02-08 14:25:33,927 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:33,927 INFO  L85        PathProgramCache]: Analyzing trace with hash -2034836839, now seen corresponding path program 4 times
[2025-02-08 14:25:33,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:33,927 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139176119]
[2025-02-08 14:25:33,927 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-08 14:25:33,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:33,946 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 158 statements into 2 equivalence classes.
[2025-02-08 14:25:34,029 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 158 of 158 statements.
[2025-02-08 14:25:34,029 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-08 14:25:34,029 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:38,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:38,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:25:38,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139176119]
[2025-02-08 14:25:38,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139176119] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 14:25:38,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601518678]
[2025-02-08 14:25:38,393 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-08 14:25:38,394 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:38,394 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:38,395 INFO  L229       MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:38,398 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process
[2025-02-08 14:25:38,494 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 158 statements into 2 equivalence classes.
[2025-02-08 14:25:43,670 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 158 of 158 statements.
[2025-02-08 14:25:43,670 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-08 14:25:43,670 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:25:43,680 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 78 conjuncts are in the unsatisfiable core
[2025-02-08 14:25:43,688 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 14:25:43,697 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-02-08 14:25:43,700 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-02-08 14:25:43,728 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:43,781 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:43,836 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:43,895 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:43,949 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,012 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,075 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,129 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,187 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,244 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,320 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,395 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,465 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,530 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,596 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,694 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,768 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,842 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,914 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:44,984 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:45,062 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:45,137 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-08 14:25:45,217 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2025-02-08 14:25:45,222 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2025-02-08 14:25:45,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:45,261 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-08 14:25:47,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:25:47,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [601518678] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-08 14:25:47,207 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-08 14:25:47,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24, 24] total 79
[2025-02-08 14:25:47,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067139375]
[2025-02-08 14:25:47,208 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-08 14:25:47,209 INFO  L757   eck$LassoCheckResult]: stem already infeasible
[2025-02-08 14:25:47,209 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:47,209 INFO  L85        PathProgramCache]: Analyzing trace with hash 1346519853, now seen corresponding path program 6 times
[2025-02-08 14:25:47,209 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:47,209 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336134728]
[2025-02-08 14:25:47,209 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-02-08 14:25:47,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:47,215 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:47,216 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:47,217 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2025-02-08 14:25:47,217 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-08 14:25:47,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849265999]
[2025-02-08 14:25:47,217 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-02-08 14:25:47,217 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:25:47,217 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:25:47,224 INFO  L229       MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:25:47,224 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process
[2025-02-08 14:25:47,279 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:47,300 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:47,300 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2025-02-08 14:25:47,300 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:47,300 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:25:47,305 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-08 14:25:47,314 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-08 14:25:47,314 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:25:47,314 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:25:47,320 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:25:48,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:25:48,438 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants.
[2025-02-08 14:25:48,441 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=2599, Invalid=3881, Unknown=0, NotChecked=0, Total=6480
[2025-02-08 14:25:48,441 INFO  L87              Difference]: Start difference. First operand 165 states and 168 transitions. cyclomatic complexity: 5 Second operand  has 81 states, 80 states have (on average 5.925) internal successors, (474), 80 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:51,462 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:25:51,462 INFO  L93              Difference]: Finished difference Result 483 states and 486 transitions.
[2025-02-08 14:25:51,462 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 486 transitions.
[2025-02-08 14:25:51,465 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:51,467 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 339 states and 342 transitions.
[2025-02-08 14:25:51,469 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2025-02-08 14:25:51,469 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 18
[2025-02-08 14:25:51,469 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 339 states and 342 transitions.
[2025-02-08 14:25:51,470 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-08 14:25:51,471 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 339 states and 342 transitions.
[2025-02-08 14:25:51,471 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 339 states and 342 transitions.
[2025-02-08 14:25:51,479 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 333.
[2025-02-08 14:25:51,479 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 333 states, 333 states have (on average 1.009009009009009) internal successors, (336), 332 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 14:25:51,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 336 transitions.
[2025-02-08 14:25:51,480 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 333 states and 336 transitions.
[2025-02-08 14:25:51,481 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. 
[2025-02-08 14:25:51,481 INFO  L432   stractBuchiCegarLoop]: Abstraction has 333 states and 336 transitions.
[2025-02-08 14:25:51,481 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 8 ============
[2025-02-08 14:25:51,481 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 336 transitions.
[2025-02-08 14:25:51,483 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-08 14:25:51,483 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:25:51,483 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:25:51,485 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [47, 47, 46, 46, 46, 46, 46, 1, 1]
[2025-02-08 14:25:51,485 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:25:51,486 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#3(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" 
[2025-02-08 14:25:51,486 INFO  L754   eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#3(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" 
[2025-02-08 14:25:51,488 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:25:51,488 INFO  L85        PathProgramCache]: Analyzing trace with hash -1594893415, now seen corresponding path program 5 times
[2025-02-08 14:25:51,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:25:51,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750458144]
[2025-02-08 14:25:51,488 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-08 14:25:51,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:25:51,534 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 326 statements into 47 equivalence classes.
[2025-02-08 14:25:52,135 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 326 of 326 statements.
[2025-02-08 14:25:52,136 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s)
[2025-02-08 14:25:52,136 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:26:11,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 7383 backedges. 0 proven. 7383 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:26:11,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:26:11,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750458144]
[2025-02-08 14:26:11,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750458144] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 14:26:11,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972583643]
[2025-02-08 14:26:11,962 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-08 14:26:11,962 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 14:26:11,962 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:26:11,965 INFO  L229       MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 14:26:11,966 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process
[2025-02-08 14:26:12,116 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 326 statements into 47 equivalence classes.