./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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:08:10,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:08:10,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-17 08:08:10,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:08:10,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:08:10,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:08:10,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:08:10,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:08:10,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:08:10,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:08:10,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:08:10,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:08:10,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:08:10,862 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:08:10,864 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:08:10,864 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:08:10,864 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:08:10,865 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:08:10,865 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:08:10,865 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:08:10,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:08:10,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:08:10,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:08:10,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:08:10,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:08:10,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:08:10,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:08:10,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:08:10,871 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:08:10,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:08:10,872 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:08:10,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:08:10,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:08:10,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:08:10,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:08:10,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:08:10,874 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:08:10,875 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c [2024-11-17 08:08:11,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:08:11,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:08:11,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:08:11,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:08:11,164 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:08:11,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2024-11-17 08:08:12,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:08:12,808 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:08:12,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2024-11-17 08:08:12,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54dca85ee/71882b749dd54b5c9f39e3a8527ffa61/FLAGb4a735b87 [2024-11-17 08:08:12,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54dca85ee/71882b749dd54b5c9f39e3a8527ffa61 [2024-11-17 08:08:12,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:08:12,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:08:12,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:08:12,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:08:12,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:08:12,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:08:12" (1/1) ... [2024-11-17 08:08:12,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f87769c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:12, skipping insertion in model container [2024-11-17 08:08:12,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:08:12" (1/1) ... [2024-11-17 08:08:12,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:08:13,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:08:13,215 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:08:13,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:08:13,310 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:08:13,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13 WrapperNode [2024-11-17 08:08:13,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:08:13,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:08:13,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:08:13,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:08:13,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,361 INFO L138 Inliner]: procedures = 109, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 114 [2024-11-17 08:08:13,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:08:13,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:08:13,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:08:13,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:08:13,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,396 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [4, 8, 8, 7]. 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 [1, 3, 3, 2]. [2024-11-17 08:08:13,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:08:13,414 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:08:13,414 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:08:13,414 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:08:13,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (1/1) ... [2024-11-17 08:08:13,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:08:13,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:08:13,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:08:13,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:08:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:08:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:08:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 08:08:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-17 08:08:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:08:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:08:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 08:08:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-17 08:08:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:08:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:08:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:08:13,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:08:13,595 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:08:13,596 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:08:13,742 INFO L1250 $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; [2024-11-17 08:08:13,750 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-17 08:08:13,750 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:08:13,764 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:08:13,764 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:08:13,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:08:13 BoogieIcfgContainer [2024-11-17 08:08:13,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:08:13,766 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:08:13,769 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:08:13,775 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:08:13,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:08:13,776 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:08:12" (1/3) ... [2024-11-17 08:08:13,777 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73e97b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:08:13, skipping insertion in model container [2024-11-17 08:08:13,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:08:13,777 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:08:13" (2/3) ... [2024-11-17 08:08:13,777 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73e97b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:08:13, skipping insertion in model container [2024-11-17 08:08:13,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:08:13,777 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:08:13" (3/3) ... [2024-11-17 08:08:13,779 INFO L332 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2024-11-17 08:08:13,824 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:08:13,825 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:08:13,825 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:08:13,825 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:08:13,825 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:08:13,825 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:08:13,825 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:08:13,825 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:08:13,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:08:13,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:08:13,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:08:13,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:08:13,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:08:13,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:08:13,855 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:08:13,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:08:13,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:08:13,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:08:13,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:08:13,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:08:13,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:08:13,864 INFO L745 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#ULTIMATE.init_returnLabel#1true assume true;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#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 7#L556true [2024-11-17 08:08:13,865 INFO L747 eck$LassoCheckResult]: Loop: 7#L556true assume true; 10#L556-1true assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 13#L557true 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 6#L561true assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 14#L565-1true call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4#L565true assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(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; 9#L569-1true call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3#L569true assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 7#L556true [2024-11-17 08:08:13,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:08:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 1 times [2024-11-17 08:08:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:08:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884572335] [2024-11-17 08:08:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:13,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:08:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:14,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:08:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:14,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:08:14,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:08:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1469605303, now seen corresponding path program 1 times [2024-11-17 08:08:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:08:14,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578157003] [2024-11-17 08:08:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:08:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:08:14,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033825997] [2024-11-17 08:08:14,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:14,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:08:14,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:08:14,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:08:14,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 08:08:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:14,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:08:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:14,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:08:14,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:08:14,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1857995402, now seen corresponding path program 1 times [2024-11-17 08:08:14,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:08:14,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36536505] [2024-11-17 08:08:14,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:14,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:08:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:08:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:08:14,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:08:14,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36536505] [2024-11-17 08:08:14,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36536505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:08:14,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:08:14,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:08:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204416112] [2024-11-17 08:08:14,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:08:27,840 WARN L286 SmtUtils]: Spent 12.87s 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) [2024-11-17 08:08:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:08:30,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:08:30,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:08:30,078 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:08:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:08:30,124 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2024-11-17 08:08:30,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2024-11-17 08:08:30,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:08:30,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 16 transitions. [2024-11-17 08:08:30,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-17 08:08:30,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-17 08:08:30,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2024-11-17 08:08:30,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:08:30,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-17 08:08:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2024-11-17 08:08:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-17 08:08:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:08:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-17 08:08:30,154 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-17 08:08:30,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:08:30,158 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-17 08:08:30,159 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:08:30,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2024-11-17 08:08:30,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:08:30,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:08:30,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:08:30,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:08:30,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:08:30,161 INFO L745 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 52#ULTIMATE.init_returnLabel#1 assume true;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#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 53#L556 assume true; 54#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 55#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 49#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 50#L565-1 [2024-11-17 08:08:30,162 INFO L747 eck$LassoCheckResult]: Loop: 50#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 47#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(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; 48#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 45#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 46#L556 assume true; 58#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 57#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 56#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 50#L565-1 [2024-11-17 08:08:30,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:08:30,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1596489626, now seen corresponding path program 1 times [2024-11-17 08:08:30,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:08:30,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805781576] [2024-11-17 08:08:30,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:30,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:08:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:08:30,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028602084] [2024-11-17 08:08:30,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:30,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:08:30,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:08:30,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:08:30,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 08:08:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:30,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:08:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:30,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:08:30,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:08:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1207434313, now seen corresponding path program 2 times [2024-11-17 08:08:30,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:08:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24504494] [2024-11-17 08:08:30,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:08:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:08:30,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071341406] [2024-11-17 08:08:30,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:08:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:08:30,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:08:30,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:08:30,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 08:08:30,448 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 08:08:30,448 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 08:08:30,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:08:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:30,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:08:30,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:08:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash -14165424, now seen corresponding path program 1 times [2024-11-17 08:08:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:08:30,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239423736] [2024-11-17 08:08:30,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:08:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:08:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:08:30,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:08:30,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239423736] [2024-11-17 08:08:30,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239423736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:08:30,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:08:30,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:08:30,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870334645] [2024-11-17 08:08:30,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:08:31,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:08:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:08:31,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:08:31,357 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:08:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:08:31,403 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-11-17 08:08:31,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2024-11-17 08:08:31,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2024-11-17 08:08:31,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2024-11-17 08:08:31,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-17 08:08:31,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-17 08:08:31,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2024-11-17 08:08:31,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:08:31,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-17 08:08:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2024-11-17 08:08:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-17 08:08:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:08:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-17 08:08:31,408 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-17 08:08:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:08:31,409 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-17 08:08:31,410 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:08:31,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2024-11-17 08:08:31,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2024-11-17 08:08:31,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:08:31,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:08:31,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:08:31,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:08:31,411 INFO L745 eck$LassoCheckResult]: Stem: 96#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 97#ULTIMATE.init_returnLabel#1 assume true;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#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 100#L556 assume true; 110#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 102#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 98#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 99#L565-1 [2024-11-17 08:08:31,412 INFO L747 eck$LassoCheckResult]: Loop: 99#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 94#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 95#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 92#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 93#L556 assume true; 101#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 103#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 104#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 99#L565-1 [2024-11-17 08:08:31,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:08:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1596489626, now seen corresponding path program 2 times [2024-11-17 08:08:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:08:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680062571] [2024-11-17 08:08:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:08:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:08:31,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2074418362] [2024-11-17 08:08:31,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:08:31,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:08:31,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:08:31,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:08:31,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 08:08:31,535 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 08:08:31,535 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 08:08:31,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:08:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:31,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:08:31,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:08:31,561 INFO L85 PathProgramCache]: Analyzing trace with hash -319930631, now seen corresponding path program 1 times [2024-11-17 08:08:31,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:08:31,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375083094] [2024-11-17 08:08:31,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:31,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:08:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:08:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604507941] [2024-11-17 08:08:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:31,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:08:31,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:08:31,575 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:08:31,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 08:08:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:31,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:08:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:31,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:08:31,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:08:31,649 INFO L85 PathProgramCache]: Analyzing trace with hash 873338258, now seen corresponding path program 1 times [2024-11-17 08:08:31,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:08:31,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939216402] [2024-11-17 08:08:31,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:31,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:08:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:08:31,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596641948] [2024-11-17 08:08:31,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:08:31,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:08:31,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:08:31,686 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:08:31,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 08:08:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:31,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:08:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:08:31,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:08:44,389 WARN L286 SmtUtils]: Spent 12.17s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-17 08:08:46,837 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:08:46,838 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:08:46,838 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:08:46,838 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:08:46,838 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:08:46,838 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:08:46,838 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:08:46,838 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:08:46,839 INFO L132 ssoRankerPreferences]: Filename of dumped script: fermat-alloca.i_Iteration3_Lasso [2024-11-17 08:08:46,839 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:08:46,839 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:08:46,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:46,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:48,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:48,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:48,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:48,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:48,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:48,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:08:48,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:09:00,438 WARN L286 SmtUtils]: Spent 12.11s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2024-11-17 08:09:00,864 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:09:00,869 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:09:00,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:00,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:00,873 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:00,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:09:00,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:00,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:00,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:00,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:00,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:00,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:00,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:00,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:00,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:00,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-17 08:09:00,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:00,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:00,918 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:00,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:09:00,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:00,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:00,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:00,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:00,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:00,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:00,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:00,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:00,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:00,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:09:00,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:00,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:00,957 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:00,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:09:00,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:00,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:00,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:00,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:00,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:00,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:00,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:00,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:00,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:00,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:00,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:00,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:00,998 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:00,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-17 08:09:01,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-17 08:09:01,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,036 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:09:01,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-17 08:09:01,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,072 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:09:01,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:09:01,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,103 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:09:01,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 [2024-11-17 08:09:01,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,130 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-17 08:09:01,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:09:01,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:09:01,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-17 08:09:01,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,164 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-17 08:09:01,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,197 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:09:01,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-17 08:09:01,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,226 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:09:01,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,251 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-17 08:09:01,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-17 08:09:01,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,277 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-17 08:09:01,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,302 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-17 08:09:01,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,328 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-17 08:09:01,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,354 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-17 08:09:01,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,382 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-17 08:09:01,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:09:01,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:09:01,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:09:01,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-17 08:09:01,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,409 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-17 08:09:01,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:09:01,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:09:01,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,443 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-17 08:09:01,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:09:01,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:09:01,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-17 08:09:01,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,493 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-17 08:09:01,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:09:01,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:09:01,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,548 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-17 08:09:01,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:09:01,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:09:01,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,590 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-17 08:09:01,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:09:01,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:09:01,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-17 08:09:01,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,623 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-17 08:09:01,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:09:01,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:09:01,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,657 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-17 08:09:01,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:09:01,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:09:01,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:01,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,704 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-17 08:09:01,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:09:01,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:09:01,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:09:01,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:09:01,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-17 08:09:01,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,741 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-17 08:09:01,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:09:01,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:09:01,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:09:01,754 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:09:01,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:09:01,765 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-17 08:09:01,765 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:09:01,794 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:09:01,819 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-17 08:09:01,819 INFO L444 ModelExtractionUtils]: 18 out of 31 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-17 08:09:01,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:01,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:01,823 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:09:01,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-17 08:09:01,826 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:09:01,838 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-11-17 08:09:01,838 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:09:01,839 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~MAX~0#1.base) 0)_1, v_rep(select (select #memory_int#1 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~MAX~0#1.base) 0)_1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1 Supporting invariants [] [2024-11-17 08:09:01,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-17 08:09:02,073 INFO L156 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2024-11-17 08:09:02,082 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-17 08:09:02,083 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-17 08:09:02,083 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~MAX~0!base,]]] [2024-11-17 08:09:02,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 08:09:02,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 08:09:02,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2024-11-17 08:09:02,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:09:02,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:09:02,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:09:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:09:02,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:09:02,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:09:02,438 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 [2024-11-17 08:09:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:02,505 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-17 08:09:02,507 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:02,661 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 34 transitions. Complement of second has 8 states. [2024-11-17 08:09:02,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:09:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2024-11-17 08:09:02,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2024-11-17 08:09:02,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:09:02,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 14 letters. Loop has 8 letters. [2024-11-17 08:09:02,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:09:02,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 16 letters. [2024-11-17 08:09:02,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:09:02,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2024-11-17 08:09:02,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:09:02,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2024-11-17 08:09:02,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-17 08:09:02,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-17 08:09:02,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2024-11-17 08:09:02,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:09:02,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-17 08:09:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2024-11-17 08:09:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-17 08:09:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-17 08:09:02,670 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-17 08:09:02,670 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-17 08:09:02,670 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:09:02,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2024-11-17 08:09:02,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:09:02,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:09:02,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:09:02,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:09:02,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:09:02,672 INFO L745 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 373#ULTIMATE.init_returnLabel#1 assume true;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#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 378#L556 assume true; 389#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 387#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 385#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 384#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 368#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 369#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 364#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 365#L556 assume true; 379#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 381#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 374#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 375#L565-1 [2024-11-17 08:09:02,672 INFO L747 eck$LassoCheckResult]: Loop: 375#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 383#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(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; 393#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 392#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 391#L556 assume true; 390#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 388#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 386#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 375#L565-1 [2024-11-17 08:09:02,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash 873338257, now seen corresponding path program 1 times [2024-11-17 08:09:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:02,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517314077] [2024-11-17 08:09:02,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:02,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:09:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:09:02,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-17 08:09:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:03,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:09:03,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517314077] [2024-11-17 08:09:03,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517314077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:09:03,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594155032] [2024-11-17 08:09:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:03,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:09:03,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:03,038 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:09:03,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-17 08:09:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:09:03,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 08:09:03,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:09:03,148 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 [2024-11-17 08:09:03,156 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 11 treesize of output 7 [2024-11-17 08:09:03,212 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 [2024-11-17 08:09:03,306 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 [2024-11-17 08:09:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:03,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:09:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:03,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594155032] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:09:03,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:09:03,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-11-17 08:09:03,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408469946] [2024-11-17 08:09:03,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:09:03,451 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:09:03,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:03,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1207434313, now seen corresponding path program 3 times [2024-11-17 08:09:03,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:03,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564485505] [2024-11-17 08:09:03,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:03,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:09:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:09:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55808256] [2024-11-17 08:09:03,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:09:03,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:09:03,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:03,466 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:09:03,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-17 08:09:03,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-17 08:09:03,568 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 08:09:03,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:09:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:09:03,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:09:04,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:09:04,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 08:09:04,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-17 08:09:04,627 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. cyclomatic complexity: 6 Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:09:04,812 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-17 08:09:04,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 77 transitions. [2024-11-17 08:09:04,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:09:04,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 53 states and 56 transitions. [2024-11-17 08:09:04,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-17 08:09:04,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-17 08:09:04,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 56 transitions. [2024-11-17 08:09:04,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:09:04,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-11-17 08:09:04,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 56 transitions. [2024-11-17 08:09:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2024-11-17 08:09:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-11-17 08:09:04,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-17 08:09:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 08:09:04,821 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-17 08:09:04,821 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:09:04,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 49 transitions. [2024-11-17 08:09:04,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:09:04,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:09:04,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:09:04,823 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2024-11-17 08:09:04,823 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:09:04,823 INFO L745 eck$LassoCheckResult]: Stem: 578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 579#ULTIMATE.init_returnLabel#1 assume true;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#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 580#L556 assume true; 607#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 606#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 574#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 575#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 572#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 573#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 568#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 569#L556 assume true; 582#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 586#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 605#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 587#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 588#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 611#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 610#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 609#L556 assume true; 608#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 585#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 576#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 577#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 598#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 604#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 603#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 602#L556 assume true; 601#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 600#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 599#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 597#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 570#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 571#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 566#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 567#L556 assume true; 581#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 583#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 584#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 589#L565-1 [2024-11-17 08:09:04,825 INFO L747 eck$LassoCheckResult]: Loop: 589#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 591#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(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; 592#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 596#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 595#L556 assume true; 594#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 593#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 590#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 589#L565-1 [2024-11-17 08:09:04,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash 436602745, now seen corresponding path program 2 times [2024-11-17 08:09:04,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:04,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750362032] [2024-11-17 08:09:04,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:04,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:09:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:09:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:09:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750362032] [2024-11-17 08:09:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750362032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:09:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855355762] [2024-11-17 08:09:05,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:09:05,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:09:05,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:05,843 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:09:05,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-17 08:09:05,994 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:09:05,994 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:09:05,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 08:09:05,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:09:06,010 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 [2024-11-17 08:09:06,023 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 11 treesize of output 7 [2024-11-17 08:09:06,068 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 [2024-11-17 08:09:06,132 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 [2024-11-17 08:09:06,196 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 [2024-11-17 08:09:06,270 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 [2024-11-17 08:09:06,352 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 [2024-11-17 08:09:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:06,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:09:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:06,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855355762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:09:06,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:09:06,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2024-11-17 08:09:06,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771120811] [2024-11-17 08:09:06,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:09:06,729 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:09:06,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:06,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1207434313, now seen corresponding path program 4 times [2024-11-17 08:09:06,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:06,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188879755] [2024-11-17 08:09:06,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:09:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:09:06,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082775242] [2024-11-17 08:09:06,740 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:09:06,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:09:06,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:06,743 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:09:06,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-17 08:09:06,846 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:09:06,847 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 08:09:06,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:09:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:09:06,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:09:07,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:09:07,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 08:09:07,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2024-11-17 08:09:07,820 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. cyclomatic complexity: 5 Second operand has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:09:08,395 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2024-11-17 08:09:08,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 146 transitions. [2024-11-17 08:09:08,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:09:08,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 101 states and 104 transitions. [2024-11-17 08:09:08,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-17 08:09:08,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-17 08:09:08,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 104 transitions. [2024-11-17 08:09:08,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:09:08,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 104 transitions. [2024-11-17 08:09:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 104 transitions. [2024-11-17 08:09:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2024-11-17 08:09:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 93 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2024-11-17 08:09:08,407 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 97 transitions. [2024-11-17 08:09:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-17 08:09:08,408 INFO L425 stractBuchiCegarLoop]: Abstraction has 94 states and 97 transitions. [2024-11-17 08:09:08,408 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:09:08,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 97 transitions. [2024-11-17 08:09:08,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:09:08,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:09:08,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:09:08,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1] [2024-11-17 08:09:08,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:09:08,412 INFO L745 eck$LassoCheckResult]: Stem: 1025#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1026#ULTIMATE.init_returnLabel#1 assume true;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#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1031#L556 assume true; 1050#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1049#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1027#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1028#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1023#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1024#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1019#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1020#L556 assume true; 1033#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1038#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1029#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1030#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1039#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1110#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1109#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1108#L556 assume true; 1107#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1106#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1105#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1104#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1103#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1102#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1101#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1100#L556 assume true; 1099#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1098#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1097#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1096#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1095#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1094#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1093#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1092#L556 assume true; 1091#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1090#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1089#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1088#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1087#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1086#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1085#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1084#L556 assume true; 1083#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1082#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1081#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1080#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1079#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1078#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1077#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1076#L556 assume true; 1075#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1074#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1073#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1072#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1071#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1070#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1069#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1068#L556 assume true; 1067#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1066#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1065#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1064#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1063#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1062#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1061#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1060#L556 assume true; 1059#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1058#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1057#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1056#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1047#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1055#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1054#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1053#L556 assume true; 1052#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1051#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1048#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1046#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1021#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1022#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1017#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1018#L556 assume true; 1032#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1036#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1037#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 1040#L565-1 [2024-11-17 08:09:08,413 INFO L747 eck$LassoCheckResult]: Loop: 1040#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1045#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(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; 1034#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1035#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1044#L556 assume true; 1043#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1042#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1041#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 1040#L565-1 [2024-11-17 08:09:08,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 702956361, now seen corresponding path program 3 times [2024-11-17 08:09:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384636648] [2024-11-17 08:09:08,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:09:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:09:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:10,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:09:10,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384636648] [2024-11-17 08:09:10,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384636648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:09:10,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496532751] [2024-11-17 08:09:10,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:09:10,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:09:10,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:10,945 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:09:10,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-17 08:09:11,922 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-17 08:09:11,922 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:09:11,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-17 08:09:11,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:09:11,951 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 [2024-11-17 08:09:11,955 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 11 treesize of output 7 [2024-11-17 08:09:11,992 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 [2024-11-17 08:09:12,056 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 [2024-11-17 08:09:12,132 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 [2024-11-17 08:09:12,195 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 [2024-11-17 08:09:12,246 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 [2024-11-17 08:09:12,326 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 [2024-11-17 08:09:12,382 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 [2024-11-17 08:09:12,448 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 [2024-11-17 08:09:12,517 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 [2024-11-17 08:09:12,570 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 [2024-11-17 08:09:12,635 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 [2024-11-17 08:09:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:12,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:09:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:13,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496532751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:09:13,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:09:13,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 31 [2024-11-17 08:09:13,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136184124] [2024-11-17 08:09:13,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:09:13,450 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:09:13,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:13,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1207434313, now seen corresponding path program 5 times [2024-11-17 08:09:13,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:13,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370892050] [2024-11-17 08:09:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:09:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:09:13,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757911364] [2024-11-17 08:09:13,461 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 08:09:13,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:09:13,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:13,463 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:09:13,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-17 08:09:13,563 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 08:09:13,563 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 08:09:13,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:09:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:09:13,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:09:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:09:15,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-17 08:09:15,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=596, Unknown=0, NotChecked=0, Total=992 [2024-11-17 08:09:15,058 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. cyclomatic complexity: 5 Second operand has 32 states, 31 states have (on average 5.935483870967742) internal successors, (184), 32 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:09:16,389 INFO L93 Difference]: Finished difference Result 281 states and 284 transitions. [2024-11-17 08:09:16,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 284 transitions. [2024-11-17 08:09:16,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:09:16,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 197 states and 200 transitions. [2024-11-17 08:09:16,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-17 08:09:16,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-17 08:09:16,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 200 transitions. [2024-11-17 08:09:16,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:09:16,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 197 states and 200 transitions. [2024-11-17 08:09:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 200 transitions. [2024-11-17 08:09:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2024-11-17 08:09:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 190 states have (on average 1.0157894736842106) internal successors, (193), 189 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 193 transitions. [2024-11-17 08:09:16,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 190 states and 193 transitions. [2024-11-17 08:09:16,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-17 08:09:16,405 INFO L425 stractBuchiCegarLoop]: Abstraction has 190 states and 193 transitions. [2024-11-17 08:09:16,405 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:09:16,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 193 transitions. [2024-11-17 08:09:16,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:09:16,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:09:16,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:09:16,410 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1] [2024-11-17 08:09:16,410 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:09:16,410 INFO L745 eck$LassoCheckResult]: Stem: 1987#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1988#ULTIMATE.init_returnLabel#1 assume true;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#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1993#L556 assume true; 2012#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2011#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1989#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1990#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1985#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1986#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1981#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1982#L556 assume true; 1995#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2000#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1991#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1992#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2001#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2168#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2167#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2166#L556 assume true; 2165#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2164#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2163#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2162#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2161#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2160#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2159#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2158#L556 assume true; 2157#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2156#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2155#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2154#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2153#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2152#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2151#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2150#L556 assume true; 2149#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2148#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2147#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2146#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2145#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2144#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2143#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2142#L556 assume true; 2141#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2140#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2139#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2138#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2137#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2136#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2135#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2134#L556 assume true; 2133#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2132#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2131#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2130#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2129#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2128#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2127#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2126#L556 assume true; 2125#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2124#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2123#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2122#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2121#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2120#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2119#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2118#L556 assume true; 2117#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2116#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2115#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2114#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2113#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2112#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2111#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2110#L556 assume true; 2109#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2108#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2107#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2106#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2105#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2104#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2103#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2102#L556 assume true; 2101#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2100#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2099#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2098#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2097#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2096#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2095#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2094#L556 assume true; 2093#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2092#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2091#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2090#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2089#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2088#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2087#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2086#L556 assume true; 2085#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2084#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2083#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2082#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2081#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2080#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2079#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2078#L556 assume true; 2077#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2076#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2075#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2074#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2073#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2072#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2071#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2070#L556 assume true; 2069#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2068#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2067#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2066#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2065#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2064#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2063#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2062#L556 assume true; 2061#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2060#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2059#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2058#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2057#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2056#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2055#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2054#L556 assume true; 2053#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2052#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2051#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2050#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2049#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2048#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2047#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2046#L556 assume true; 2045#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2044#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2043#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2042#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2041#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2040#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2039#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2038#L556 assume true; 2037#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2036#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2035#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2034#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2033#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2032#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2031#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2030#L556 assume true; 2029#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2028#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2027#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2026#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2025#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2024#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2023#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2022#L556 assume true; 2021#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2020#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2019#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2018#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2009#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 2017#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2016#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2015#L556 assume true; 2014#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2013#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2010#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 2008#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1983#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1984#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1979#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1980#L556 assume true; 1994#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1998#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1999#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 2002#L565-1 [2024-11-17 08:09:16,411 INFO L747 eck$LassoCheckResult]: Loop: 2002#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2007#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(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; 1996#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1997#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 2006#L556 assume true; 2005#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 2004#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 2003#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 2002#L565-1 [2024-11-17 08:09:16,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:16,411 INFO L85 PathProgramCache]: Analyzing trace with hash -574088471, now seen corresponding path program 4 times [2024-11-17 08:09:16,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:16,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957496421] [2024-11-17 08:09:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:09:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:09:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:22,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:09:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957496421] [2024-11-17 08:09:22,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957496421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:09:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800496795] [2024-11-17 08:09:22,783 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:09:22,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:09:22,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:22,785 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:09:22,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-17 08:09:27,572 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:09:27,572 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:09:27,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 1810 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-17 08:09:27,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:09:27,605 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 [2024-11-17 08:09:27,612 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 11 treesize of output 7 [2024-11-17 08:09:27,654 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 [2024-11-17 08:09:27,707 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 [2024-11-17 08:09:27,776 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 [2024-11-17 08:09:27,845 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 [2024-11-17 08:09:27,932 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 [2024-11-17 08:09:28,020 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 [2024-11-17 08:09:28,099 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 [2024-11-17 08:09:28,178 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 [2024-11-17 08:09:28,256 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 [2024-11-17 08:09:28,322 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 [2024-11-17 08:09:28,378 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 [2024-11-17 08:09:28,453 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 [2024-11-17 08:09:28,520 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 [2024-11-17 08:09:28,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 [2024-11-17 08:09:28,655 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 [2024-11-17 08:09:28,718 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 [2024-11-17 08:09:28,777 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 [2024-11-17 08:09:28,844 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 [2024-11-17 08:09:28,905 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 [2024-11-17 08:09:28,983 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 [2024-11-17 08:09:29,053 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 [2024-11-17 08:09:29,110 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 [2024-11-17 08:09:29,173 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 [2024-11-17 08:09:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:29,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:09:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:09:31,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800496795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:09:31,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:09:31,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 25] total 56 [2024-11-17 08:09:31,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695989078] [2024-11-17 08:09:31,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:09:31,480 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:09:31,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1207434313, now seen corresponding path program 6 times [2024-11-17 08:09:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:31,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103998930] [2024-11-17 08:09:31,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:31,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:09:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:09:31,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1116238967] [2024-11-17 08:09:31,492 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-17 08:09:31,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:09:31,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:31,494 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:09:31,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-17 08:09:31,591 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-17 08:09:31,591 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 08:09:31,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:09:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:09:31,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:09:33,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:09:33,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-17 08:09:33,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1404, Invalid=1788, Unknown=0, NotChecked=0, Total=3192 [2024-11-17 08:09:33,279 INFO L87 Difference]: Start difference. First operand 190 states and 193 transitions. cyclomatic complexity: 5 Second operand has 57 states, 56 states have (on average 6.75) internal successors, (378), 57 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:09:36,447 INFO L93 Difference]: Finished difference Result 557 states and 560 transitions. [2024-11-17 08:09:36,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 557 states and 560 transitions. [2024-11-17 08:09:36,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:09:36,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 557 states to 389 states and 392 transitions. [2024-11-17 08:09:36,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-17 08:09:36,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-17 08:09:36,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 389 states and 392 transitions. [2024-11-17 08:09:36,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:09:36,456 INFO L218 hiAutomatonCegarLoop]: Abstraction has 389 states and 392 transitions. [2024-11-17 08:09:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states and 392 transitions. [2024-11-17 08:09:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 382. [2024-11-17 08:09:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 382 states have (on average 1.0078534031413613) internal successors, (385), 381 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 385 transitions. [2024-11-17 08:09:36,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 382 states and 385 transitions. [2024-11-17 08:09:36,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-17 08:09:36,477 INFO L425 stractBuchiCegarLoop]: Abstraction has 382 states and 385 transitions. [2024-11-17 08:09:36,477 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:09:36,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 382 states and 385 transitions. [2024-11-17 08:09:36,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:09:36,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:09:36,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:09:36,484 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1] [2024-11-17 08:09:36,484 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:09:36,485 INFO L745 eck$LassoCheckResult]: Stem: 3970#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3971#ULTIMATE.init_returnLabel#1 assume true;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#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 3976#L556 assume true; 3995#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 3994#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3972#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3973#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3968#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3969#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3964#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3965#L556 assume true; 3978#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 3983#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3974#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3975#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3984#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4343#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4342#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4341#L556 assume true; 4340#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4339#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4338#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4337#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4336#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4335#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4334#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4333#L556 assume true; 4332#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4331#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4330#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4329#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4328#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4327#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4326#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4325#L556 assume true; 4324#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4323#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4322#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4321#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4320#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4319#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4318#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4317#L556 assume true; 4316#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4315#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4314#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4313#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4312#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4311#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4310#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4309#L556 assume true; 4308#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4307#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4306#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4305#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4304#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4303#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4302#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4301#L556 assume true; 4300#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4299#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4298#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4297#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4296#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4295#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4294#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4293#L556 assume true; 4292#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4291#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4290#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4289#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4288#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4287#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4286#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4285#L556 assume true; 4284#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4283#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4282#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4281#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4280#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4279#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4278#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4277#L556 assume true; 4276#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4275#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4274#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4273#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4272#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4271#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4270#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4269#L556 assume true; 4268#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4267#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4266#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4265#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4264#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4263#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4262#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4261#L556 assume true; 4260#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4259#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4258#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4257#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4256#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4255#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4254#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4253#L556 assume true; 4252#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4251#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4250#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4249#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4248#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4247#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4246#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4245#L556 assume true; 4244#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4243#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4242#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4241#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4240#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4239#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4238#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4237#L556 assume true; 4236#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4235#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4234#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4233#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4232#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4231#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4230#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4229#L556 assume true; 4228#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4227#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4226#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4225#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4224#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4223#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4222#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4221#L556 assume true; 4220#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4219#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4218#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4217#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4216#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4215#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4214#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4213#L556 assume true; 4212#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4211#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4210#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4209#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4208#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4207#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4206#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4205#L556 assume true; 4204#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4203#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4202#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4201#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4200#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4199#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4198#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4197#L556 assume true; 4196#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4195#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4194#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4193#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4192#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4191#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4190#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4189#L556 assume true; 4188#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4187#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4186#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4185#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4184#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4183#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4182#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4181#L556 assume true; 4180#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4179#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4178#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4177#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4176#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4175#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4174#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4173#L556 assume true; 4172#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4171#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4170#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4169#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4168#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4167#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4166#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4165#L556 assume true; 4164#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4163#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4162#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4161#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4160#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4159#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4158#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4157#L556 assume true; 4156#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4155#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4154#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4153#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4152#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4151#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4150#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4149#L556 assume true; 4148#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4147#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4146#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4145#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4144#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4143#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4142#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4141#L556 assume true; 4140#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4139#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4138#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4137#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4136#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4135#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4134#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4133#L556 assume true; 4132#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4131#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4130#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4129#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4128#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4127#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4126#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4125#L556 assume true; 4124#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4123#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4122#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4121#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4120#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4119#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4118#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4117#L556 assume true; 4116#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4115#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4114#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4113#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4112#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4111#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4110#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4109#L556 assume true; 4108#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4107#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4106#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4105#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4104#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4103#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4102#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4101#L556 assume true; 4100#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4099#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4098#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4097#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4096#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4095#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4094#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4093#L556 assume true; 4092#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4091#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4090#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4089#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4088#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4087#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4086#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4085#L556 assume true; 4084#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4083#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4082#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4081#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4080#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4079#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4078#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4077#L556 assume true; 4076#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4075#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4074#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4073#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4072#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4071#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4070#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4069#L556 assume true; 4068#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4067#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4066#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4065#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4064#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4063#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4062#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4061#L556 assume true; 4060#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4059#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4058#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4057#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4056#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4055#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4054#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4053#L556 assume true; 4052#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4051#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4050#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4049#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4048#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4047#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4046#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4045#L556 assume true; 4044#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4043#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4042#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4041#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4040#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4039#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4038#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4037#L556 assume true; 4036#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4035#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4034#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4033#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4032#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4031#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4030#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4029#L556 assume true; 4028#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4027#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4026#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4025#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4024#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4023#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4022#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4021#L556 assume true; 4020#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4019#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4018#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4017#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4016#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4015#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4014#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4013#L556 assume true; 4012#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4011#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4010#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4009#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4008#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4007#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4006#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 4005#L556 assume true; 4004#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 4003#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4002#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 4001#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3992#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 4000#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3999#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3998#L556 assume true; 3997#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 3996#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3993#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3991#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3966#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3967#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3962#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3963#L556 assume true; 3977#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 3981#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3982#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 3985#L565-1 [2024-11-17 08:09:36,486 INFO L747 eck$LassoCheckResult]: Loop: 3985#L565-1 call main_#t~mem21#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3990#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#2(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(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; 3979#L569-1 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3980#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3989#L556 assume true; 3988#L556-1 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 3987#L557 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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(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#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3986#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#2(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#2(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; 3985#L565-1 [2024-11-17 08:09:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash -116307415, now seen corresponding path program 5 times [2024-11-17 08:09:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:36,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292184448] [2024-11-17 08:09:36,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:09:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat