./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-09 15:25:21,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:25:21,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:25:21,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:25:21,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:25:22,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:25:22,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:25:22,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:25:22,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:25:22,018 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:25:22,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:25:22,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:25:22,033 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:25:22,033 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:25:22,033 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:25:22,033 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:25:22,033 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:25:22,034 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:25:22,034 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:25:22,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:25:22,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:25:22,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:25:22,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:25:22,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:25:22,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:25:22,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:25:22,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:25:22,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:25:22,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:25:22,038 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:25:22,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:25:22,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:25:22,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:25:22,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:25:22,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:25:22,040 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:25:22,040 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-09 15:25:22,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:25:22,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:25:22,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:25:22,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:25:22,404 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:25:22,405 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-09 15:25:23,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:25:24,210 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:25:24,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2024-11-09 15:25:24,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b50e99b/a95c6d4241074d75930bfd15ae9fcadf/FLAGd81e9d278 [2024-11-09 15:25:24,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b50e99b/a95c6d4241074d75930bfd15ae9fcadf [2024-11-09 15:25:24,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:25:24,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:25:24,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:25:24,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:25:24,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:25:24,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c07803b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24, skipping insertion in model container [2024-11-09 15:25:24,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:25:24,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:25:24,524 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:25:24,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:25:24,585 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:25:24,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24 WrapperNode [2024-11-09 15:25:24,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:25:24,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:25:24,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:25:24,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:25:24,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,616 INFO L138 Inliner]: procedures = 109, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 115 [2024-11-09 15:25:24,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:25:24,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:25:24,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:25:24,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:25:24,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,638 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [8, 4, 7, 8]. 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 [3, 1, 2, 3]. [2024-11-09 15:25:24,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:25:24,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:25:24,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:25:24,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:25:24,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (1/1) ... [2024-11-09 15:25:24,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:24,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:24,685 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-09 15:25:24,688 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-09 15:25:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:25:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:25:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 15:25:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 15:25:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:25:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:25:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 15:25:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 15:25:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:25:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:25:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:25:24,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:25:24,805 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:25:24,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:25:24,924 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-09 15:25:24,924 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:25:24,936 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:25:24,936 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:25:24,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:24 BoogieIcfgContainer [2024-11-09 15:25:24,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:25:24,937 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:25:24,937 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:25:24,940 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:25:24,941 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:24,941 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:25:24" (1/3) ... [2024-11-09 15:25:24,942 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@534190c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:25:24, skipping insertion in model container [2024-11-09 15:25:24,942 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:24,942 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:24" (2/3) ... [2024-11-09 15:25:24,942 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@534190c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:25:24, skipping insertion in model container [2024-11-09 15:25:24,942 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:24,942 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:24" (3/3) ... [2024-11-09 15:25:24,943 INFO L332 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2024-11-09 15:25:24,982 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:25:24,982 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:25:24,983 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:25:24,983 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:25:24,983 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:25:24,983 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:25:24,983 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:25:24,983 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:25:24,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:25,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:25:25,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:25,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:25,004 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:25:25,004 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:25,004 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:25:25,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:25,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:25:25,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:25,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:25,006 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:25:25,006 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:25,012 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true 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#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 6#L556-2true [2024-11-09 15:25:25,013 INFO L747 eck$LassoCheckResult]: Loop: 6#L556-2true assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 5#L561true assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 7#L561-2true call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(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#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#2(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; 10#L565-2true call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(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; 6#L556-2true [2024-11-09 15:25:25,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:25,017 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:25:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:25,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530069913] [2024-11-09 15:25:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:25,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:25,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:25,206 INFO L85 PathProgramCache]: Analyzing trace with hash -903226603, now seen corresponding path program 1 times [2024-11-09 15:25:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:25,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248925497] [2024-11-09 15:25:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 15:25:25,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1677680775] [2024-11-09 15:25:25,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:25,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:25,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:25,236 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-09 15:25:25,237 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-09 15:25:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:25,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash 643070227, now seen corresponding path program 1 times [2024-11-09 15:25:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:25,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496390698] [2024-11-09 15:25:25,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:25,857 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-09 15:25:25,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:25,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496390698] [2024-11-09 15:25:25,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496390698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:25:25,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:25:25,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:25:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884754669] [2024-11-09 15:25:25,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:25:38,635 WARN L286 SmtUtils]: Spent 12.77s 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-09 15:25:39,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:39,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:25:39,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:25:39,068 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:39,104 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2024-11-09 15:25:39,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2024-11-09 15:25:39,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:25:39,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 14 transitions. [2024-11-09 15:25:39,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-09 15:25:39,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:25:39,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2024-11-09 15:25:39,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:25:39,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-09 15:25:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2024-11-09 15:25:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 15:25:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 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-09 15:25:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-11-09 15:25:39,144 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-09 15:25:39,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:25:39,150 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-09 15:25:39,152 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:25:39,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2024-11-09 15:25:39,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:25:39,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:39,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:39,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:25:39,153 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:39,154 INFO L745 eck$LassoCheckResult]: Stem: 50#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 51#L-1 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#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 48#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 49#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 46#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 47#L561-2 [2024-11-09 15:25:39,154 INFO L747 eck$LassoCheckResult]: Loop: 47#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 44#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#2(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; 45#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 42#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 43#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 53#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 52#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 47#L561-2 [2024-11-09 15:25:39,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash 28699821, now seen corresponding path program 1 times [2024-11-09 15:25:39,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:39,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703995185] [2024-11-09 15:25:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:39,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 15:25:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843140224] [2024-11-09 15:25:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:39,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:39,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:39,230 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-09 15:25:39,232 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-09 15:25:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:39,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:39,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:39,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:39,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 2 times [2024-11-09 15:25:39,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:39,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067018941] [2024-11-09 15:25:39,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:39,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 15:25:39,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480382756] [2024-11-09 15:25:39,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:25:39,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:39,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:39,380 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-09 15:25:39,381 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-09 15:25:39,442 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 15:25:39,443 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 15:25:39,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:39,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:39,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1341656857, now seen corresponding path program 1 times [2024-11-09 15:25:39,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:39,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861896594] [2024-11-09 15:25:39,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:39,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:39,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:39,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861896594] [2024-11-09 15:25:39,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861896594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:25:39,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:25:39,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:25:39,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638942229] [2024-11-09 15:25:39,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:25:40,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:40,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:25:40,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:25:40,583 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:40,633 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-09 15:25:40,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2024-11-09 15:25:40,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-09 15:25:40,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 22 transitions. [2024-11-09 15:25:40,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:25:40,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:25:40,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-11-09 15:25:40,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:25:40,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-09 15:25:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-11-09 15:25:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 15:25:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-09 15:25:40,637 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-09 15:25:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:25:40,638 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-09 15:25:40,638 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:25:40,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2024-11-09 15:25:40,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-09 15:25:40,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:40,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:40,639 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:25:40,639 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:40,639 INFO L745 eck$LassoCheckResult]: Stem: 92#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 93#L-1 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#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 96#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 100#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 89#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 90#L561-2 [2024-11-09 15:25:40,640 INFO L747 eck$LassoCheckResult]: Loop: 90#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 87#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 88#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 103#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 102#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 101#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 97#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 90#L561-2 [2024-11-09 15:25:40,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:40,640 INFO L85 PathProgramCache]: Analyzing trace with hash 28699821, now seen corresponding path program 2 times [2024-11-09 15:25:40,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:40,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936813998] [2024-11-09 15:25:40,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 15:25:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486820848] [2024-11-09 15:25:40,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:25:40,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:40,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,656 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-09 15:25:40,663 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-09 15:25:40,730 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 15:25:40,730 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 15:25:40,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:40,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:40,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:40,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1510934149, now seen corresponding path program 1 times [2024-11-09 15:25:40,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:40,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456440245] [2024-11-09 15:25:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:40,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 15:25:40,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535777620] [2024-11-09 15:25:40,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:40,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:40,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,758 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-09 15:25:40,759 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-09 15:25:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:40,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:40,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:40,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1398915161, now seen corresponding path program 1 times [2024-11-09 15:25:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:40,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955811827] [2024-11-09 15:25:40,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 15:25:40,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779051459] [2024-11-09 15:25:40,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:40,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:40,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,835 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-09 15:25:40,836 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-09 15:25:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:40,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:40,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:53,383 WARN L286 SmtUtils]: Spent 12.39s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 15:26:05,509 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 15:26:06,738 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:26:06,738 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:26:06,739 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:26:06,739 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:26:06,739 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:26:06,739 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:06,739 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:26:06,739 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:26:06,739 INFO L132 ssoRankerPreferences]: Filename of dumped script: fermat-alloca.i_Iteration3_Lasso [2024-11-09 15:26:06,739 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:26:06,739 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:26:06,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:06,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:07,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:07,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:07,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:07,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:19,866 WARN L286 SmtUtils]: Spent 12.11s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2024-11-09 15:26:20,418 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:26:20,429 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:26:20,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,436 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-09 15:26:20,437 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-09 15:26:20,440 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-09 15:26:20,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,468 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-09 15:26:20,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,471 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-09 15:26:20,474 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-09 15:26:20,475 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-09 15:26:20,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:20,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,505 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-09 15:26:20,506 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-09 15:26:20,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-09 15:26:20,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 15:26:20,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,533 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-09 15:26:20,534 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-09 15:26:20,536 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-09 15:26:20,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:20,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,564 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-09 15:26:20,566 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-09 15:26:20,566 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-09 15:26:20,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,593 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-09 15:26:20,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,602 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-09 15:26:20,603 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-09 15:26:20,604 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-09 15:26:20,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,631 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-09 15:26:20,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,633 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-09 15:26:20,634 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-09 15:26:20,636 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-09 15:26:20,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,648 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,658 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-09 15:26:20,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,660 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-09 15:26:20,662 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-09 15:26:20,664 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-09 15:26:20,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:20,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,687 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-09 15:26:20,689 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-09 15:26:20,692 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-09 15:26:20,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 15:26:20,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,716 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-09 15:26:20,717 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-09 15:26:20,718 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-09 15:26:20,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,742 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-09 15:26:20,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,744 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-09 15:26:20,745 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-09 15:26:20,746 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-09 15:26:20,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:20,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:20,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-09 15:26:20,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,775 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-09 15:26:20,776 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-09 15:26:20,777 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-09 15:26:20,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:20,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,801 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-09 15:26:20,802 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-09 15:26:20,803 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-09 15:26:20,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,830 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-09 15:26:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,832 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-09 15:26:20,833 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-09 15:26:20,834 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-09 15:26:20,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 15:26:20,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,859 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-09 15:26:20,861 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-09 15:26:20,861 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-09 15:26:20,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,887 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-09 15:26:20,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,890 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-09 15:26:20,890 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-09 15:26:20,891 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-09 15:26:20,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:26:20,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,917 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-09 15:26:20,919 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-09 15:26:20,919 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-09 15:26:20,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:20,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:20,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,946 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-09 15:26:20,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,948 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-09 15:26:20,950 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-09 15:26:20,951 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-09 15:26:20,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:20,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-09 15:26:20,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:20,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:20,982 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-09 15:26:20,983 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-09 15:26:20,984 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-09 15:26:20,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:20,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:20,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:20,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:20,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:20,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:20,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:20,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:21,007 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-09 15:26:21,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:21,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:21,009 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-09 15:26:21,010 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-09 15:26:21,011 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-09 15:26:21,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:21,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:21,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:21,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:21,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:21,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:21,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:21,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:21,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-09 15:26:21,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:21,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:21,047 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-09 15:26:21,048 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-09 15:26:21,048 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-09 15:26:21,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:21,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:21,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:21,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:21,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:21,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:21,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:21,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:21,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-09 15:26:21,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:21,076 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-09 15:26:21,080 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-09 15:26:21,081 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-09 15:26:21,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:21,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:21,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:21,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:21,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:21,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:21,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:21,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:21,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:21,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:21,110 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-09 15:26:21,111 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-09 15:26:21,112 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-09 15:26:21,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:21,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:21,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:21,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:21,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:21,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:21,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:21,166 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-09 15:26:21,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:21,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:21,188 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-09 15:26:21,190 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-09 15:26:21,190 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-09 15:26:21,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:21,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:21,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:21,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:21,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:21,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:21,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:21,220 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-09 15:26:21,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:21,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:21,225 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-09 15:26:21,226 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-09 15:26:21,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-09 15:26:21,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:21,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:21,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:21,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:21,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:21,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:21,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:21,261 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-09 15:26:21,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:21,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:21,265 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-09 15:26:21,266 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-09 15:26:21,267 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-09 15:26:21,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:21,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:21,278 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:26:21,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:21,296 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-09 15:26:21,297 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-09 15:26:21,350 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:26:21,471 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2024-11-09 15:26:21,471 INFO L444 ModelExtractionUtils]: 2 out of 46 variables were initially zero. Simplification set additionally 41 variables to zero. [2024-11-09 15:26:21,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:21,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:21,475 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-09 15:26:21,476 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-09 15:26:21,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:26:21,490 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-11-09 15:26:21,490 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:26:21,491 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1, v_rep(select (select #memory_int#1 ULTIMATE.start_main_~MAX~0#1.base) ULTIMATE.start_main_~MAX~0#1.offset)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1 + 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~MAX~0#1.base) ULTIMATE.start_main_~MAX~0#1.offset)_1 Supporting invariants [] [2024-11-09 15:26:21,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-09 15:26:21,669 INFO L156 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2024-11-09 15:26:21,674 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 15:26:21,675 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 15:26:21,675 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~MAX~0!base,]]] [2024-11-09 15:26:21,676 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:26:21,676 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:26:21,676 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2024-11-09 15:26:21,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:21,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:26:21,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:21,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:26:21,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:21,809 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 31 treesize of output 19 [2024-11-09 15:26:21,834 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-09 15:26:21,837 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:26:21,838 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:21,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 30 transitions. Complement of second has 7 states. [2024-11-09 15:26:21,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:26:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-11-09 15:26:21,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 7 letters. [2024-11-09 15:26:21,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:21,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 7 letters. [2024-11-09 15:26:21,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:21,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 14 letters. [2024-11-09 15:26:21,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:21,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2024-11-09 15:26:21,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:26:21,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2024-11-09 15:26:21,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-09 15:26:21,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:26:21,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2024-11-09 15:26:21,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:21,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-09 15:26:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2024-11-09 15:26:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 15:26:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 15:26:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-09 15:26:21,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-09 15:26:21,939 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-09 15:26:21,939 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:26:21,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2024-11-09 15:26:21,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:26:21,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:21,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:21,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:21,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:21,945 INFO L745 eck$LassoCheckResult]: Stem: 363#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 364#L-1 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#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 366#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 370#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 368#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 367#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 353#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 354#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 349#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 350#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 361#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 357#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 358#L561-2 [2024-11-09 15:26:21,945 INFO L747 eck$LassoCheckResult]: Loop: 358#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 365#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#2(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; 374#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 373#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 372#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 371#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 369#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 358#L561-2 [2024-11-09 15:26:21,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:21,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1398915159, now seen corresponding path program 1 times [2024-11-09 15:26:21,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:21,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167513606] [2024-11-09 15:26:21,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:21,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:22,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:22,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167513606] [2024-11-09 15:26:22,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167513606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:26:22,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219676393] [2024-11-09 15:26:22,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:22,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:22,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:22,402 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-09 15:26:22,403 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-09 15:26:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:22,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 15:26:22,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:22,498 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-09 15:26:22,504 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-09 15:26:22,542 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 25 treesize of output 13 [2024-11-09 15:26:22,619 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-09 15:26:22,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 15:26:22,662 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-09 15:26:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:22,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:26:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:22,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219676393] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:26:22,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:26:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-11-09 15:26:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793822780] [2024-11-09 15:26:22,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:26:22,783 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:26:22,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 3 times [2024-11-09 15:26:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:22,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752260038] [2024-11-09 15:26:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 15:26:22,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29147975] [2024-11-09 15:26:22,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:26:22,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:22,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:22,807 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-09 15:26:22,813 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-09 15:26:22,867 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 15:26:22,868 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 15:26:22,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 15:26:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 15:26:23,940 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. cyclomatic complexity: 6 Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 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-09 15:26:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:24,058 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-11-09 15:26:24,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 67 transitions. [2024-11-09 15:26:24,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:26:24,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 46 states and 49 transitions. [2024-11-09 15:26:24,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:26:24,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:26:24,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 49 transitions. [2024-11-09 15:26:24,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:24,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-09 15:26:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 49 transitions. [2024-11-09 15:26:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2024-11-09 15:26:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 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-09 15:26:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-11-09 15:26:24,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-11-09 15:26:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:26:24,064 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-11-09 15:26:24,064 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:26:24,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 43 transitions. [2024-11-09 15:26:24,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:26:24,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:24,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:24,065 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2024-11-09 15:26:24,065 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:24,065 INFO L745 eck$LassoCheckResult]: Stem: 543#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 544#L-1 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#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 547#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 551#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 534#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 535#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 545#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 559#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 558#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 557#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 542#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 536#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 537#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 560#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 565#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 564#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 563#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 562#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 561#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 546#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 532#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 533#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 528#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 529#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 540#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 556#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 555#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 554#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 553#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 526#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 527#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 539#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 541#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 548#L561-2 [2024-11-09 15:26:24,066 INFO L747 eck$LassoCheckResult]: Loop: 548#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 530#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#2(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; 531#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 538#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 552#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 550#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 549#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 548#L561-2 [2024-11-09 15:26:24,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1830413909, now seen corresponding path program 2 times [2024-11-09 15:26:24,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:24,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542591018] [2024-11-09 15:26:24,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:24,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:24,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:24,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542591018] [2024-11-09 15:26:24,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542591018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:26:24,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120869019] [2024-11-09 15:26:24,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:26:24,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:24,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:24,667 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-09 15:26:24,668 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-09 15:26:24,798 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:26:24,798 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:26:24,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 15:26:24,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:24,818 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-09 15:26:24,824 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-09 15:26:24,863 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 25 treesize of output 13 [2024-11-09 15:26:24,956 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 25 treesize of output 13 [2024-11-09 15:26:25,057 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 25 treesize of output 13 [2024-11-09 15:26:25,118 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 25 treesize of output 13 [2024-11-09 15:26:25,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 15:26:25,175 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-09 15:26:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:25,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:26:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:25,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120869019] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:26:25,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:26:25,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2024-11-09 15:26:25,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195330580] [2024-11-09 15:26:25,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:26:25,397 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:26:25,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 4 times [2024-11-09 15:26:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:25,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136474951] [2024-11-09 15:26:25,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 15:26:25,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [808442959] [2024-11-09 15:26:25,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:26:25,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:25,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:25,405 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-09 15:26:25,406 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-09 15:26:25,467 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:26:25,467 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 15:26:25,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:25,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:26,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:26,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 15:26:26,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2024-11-09 15:26:26,365 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. cyclomatic complexity: 5 Second operand has 23 states, 22 states have (on average 4.409090909090909) internal successors, (97), 23 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-09 15:26:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:26,784 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2024-11-09 15:26:26,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 127 transitions. [2024-11-09 15:26:26,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:26:26,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 88 states and 91 transitions. [2024-11-09 15:26:26,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:26:26,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:26:26,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 91 transitions. [2024-11-09 15:26:26,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:26,787 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 91 transitions. [2024-11-09 15:26:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 91 transitions. [2024-11-09 15:26:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2024-11-09 15:26:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 81 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-09 15:26:26,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-09 15:26:26,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 15:26:26,792 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-09 15:26:26,792 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:26:26,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 85 transitions. [2024-11-09 15:26:26,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:26:26,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:26,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:26,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1] [2024-11-09 15:26:26,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:26,796 INFO L745 eck$LassoCheckResult]: Stem: 943#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 944#L-1 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#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 946#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 950#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 934#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 935#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 945#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1007#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1006#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1005#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1004#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 936#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 937#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 932#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 933#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 928#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 929#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 940#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 942#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1003#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1002#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1001#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1000#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 999#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 998#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 997#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 996#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 995#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 994#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 993#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 992#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 991#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 990#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 989#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 988#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 987#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 986#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 985#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 984#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 983#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 982#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 981#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 980#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 979#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 978#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 977#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 976#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 975#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 974#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 973#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 972#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 971#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 970#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 969#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 968#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 967#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 966#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 965#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 964#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 963#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 962#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 961#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 955#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 960#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 959#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 958#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 957#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 956#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 954#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 953#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 952#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 926#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 927#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 939#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 941#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 947#L561-2 [2024-11-09 15:26:26,796 INFO L747 eck$LassoCheckResult]: Loop: 947#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 930#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#2(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; 931#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 938#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 951#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 949#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 948#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 947#L561-2 [2024-11-09 15:26:26,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash 589434155, now seen corresponding path program 3 times [2024-11-09 15:26:26,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:26,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394853140] [2024-11-09 15:26:26,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:28,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:28,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394853140] [2024-11-09 15:26:28,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394853140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:26:28,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104310498] [2024-11-09 15:26:28,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:26:28,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:28,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:28,631 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-09 15:26:28,635 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-09 15:26:29,632 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-09 15:26:29,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:26:29,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 15:26:29,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:29,650 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-09 15:26:29,656 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-09 15:26:29,693 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 25 treesize of output 13 [2024-11-09 15:26:29,756 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 25 treesize of output 13 [2024-11-09 15:26:29,827 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 25 treesize of output 13 [2024-11-09 15:26:29,887 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 25 treesize of output 13 [2024-11-09 15:26:29,947 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 25 treesize of output 13 [2024-11-09 15:26:30,016 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 25 treesize of output 13 [2024-11-09 15:26:30,084 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 25 treesize of output 13 [2024-11-09 15:26:30,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 25 treesize of output 13 [2024-11-09 15:26:30,213 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 25 treesize of output 13 [2024-11-09 15:26:30,277 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 25 treesize of output 13 [2024-11-09 15:26:30,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 15:26:30,348 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-09 15:26:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:30,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:26:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:30,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104310498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:26:30,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:26:30,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 41 [2024-11-09 15:26:30,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910351803] [2024-11-09 15:26:30,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:26:30,879 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:26:30,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 5 times [2024-11-09 15:26:30,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316064947] [2024-11-09 15:26:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:30,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 15:26:30,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933775532] [2024-11-09 15:26:30,887 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 15:26:30,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:30,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:30,889 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-09 15:26:30,891 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-09 15:26:30,954 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 15:26:30,954 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 15:26:30,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:30,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:32,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 15:26:32,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=1075, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 15:26:32,029 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. cyclomatic complexity: 5 Second operand has 42 states, 41 states have (on average 5.439024390243903) internal successors, (223), 42 states have internal predecessors, (223), 0 states have call successors, (0), 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-09 15:26:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:32,953 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2024-11-09 15:26:32,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 244 states and 247 transitions. [2024-11-09 15:26:32,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:26:32,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 244 states to 172 states and 175 transitions. [2024-11-09 15:26:32,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:26:32,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:26:32,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 175 transitions. [2024-11-09 15:26:32,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:32,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 172 states and 175 transitions. [2024-11-09 15:26:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 175 transitions. [2024-11-09 15:26:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2024-11-09 15:26:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 166 states have (on average 1.0180722891566265) internal successors, (169), 165 states have internal predecessors, (169), 0 states have call successors, (0), 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-09 15:26:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 169 transitions. [2024-11-09 15:26:32,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 166 states and 169 transitions. [2024-11-09 15:26:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-09 15:26:32,964 INFO L425 stractBuchiCegarLoop]: Abstraction has 166 states and 169 transitions. [2024-11-09 15:26:32,964 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:26:32,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 169 transitions. [2024-11-09 15:26:32,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:26:32,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:32,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:32,969 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 22, 22, 22, 22, 22, 1, 1, 1] [2024-11-09 15:26:32,969 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:32,969 INFO L745 eck$LassoCheckResult]: Stem: 1801#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1802#L-1 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#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1798#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1799#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1791#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1792#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1803#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1948#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1947#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1946#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1797#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1793#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1794#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1789#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1790#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1785#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1786#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1800#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1945#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1944#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1943#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1942#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1941#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1940#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1939#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1938#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1937#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1936#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1935#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1934#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1933#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1932#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1931#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1930#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1929#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1928#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1927#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1926#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1925#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1924#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1923#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1922#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1921#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1920#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1919#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1918#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1917#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1916#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1915#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1914#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1913#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1912#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1911#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1910#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1909#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1908#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1907#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1906#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1905#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1904#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1903#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1902#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1901#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1900#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1899#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1898#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1897#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1896#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1895#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1894#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1893#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1892#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1891#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1890#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1889#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1888#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1887#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1886#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1885#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1884#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1883#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1882#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1881#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1880#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1879#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1878#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1877#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1876#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1875#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1874#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1873#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1872#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1871#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1870#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1869#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1868#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1867#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1866#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1865#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1864#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1863#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1862#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1861#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1860#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1859#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1858#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1857#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1856#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1855#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1854#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1853#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1852#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1851#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1850#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1849#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1848#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1847#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1846#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1845#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1844#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1843#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1842#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1841#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1840#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1839#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1838#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1837#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1836#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1835#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1834#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1833#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1832#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1831#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1830#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1829#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1828#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1827#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1826#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1825#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1824#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1823#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1822#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1821#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1820#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1819#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1818#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1812#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1817#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1816#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1815#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1814#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1813#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1811#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1787#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1788#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1783#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1784#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1795#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1796#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 1804#L561-2 [2024-11-09 15:26:32,970 INFO L747 eck$LassoCheckResult]: Loop: 1804#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1810#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#2(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; 1809#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1808#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1807#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 1806#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1805#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 1804#L561-2 [2024-11-09 15:26:32,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:32,970 INFO L85 PathProgramCache]: Analyzing trace with hash 626578475, now seen corresponding path program 4 times [2024-11-09 15:26:32,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:32,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635153397] [2024-11-09 15:26:32,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:37,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:37,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635153397] [2024-11-09 15:26:37,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635153397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:26:37,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029044515] [2024-11-09 15:26:37,626 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:26:37,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:37,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:37,628 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-09 15:26:37,629 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-09 15:26:41,822 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:26:41,822 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:26:41,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 15:26:41,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:41,860 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-09 15:26:41,868 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-09 15:26:41,897 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 25 treesize of output 13 [2024-11-09 15:26:41,952 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 25 treesize of output 13 [2024-11-09 15:26:42,009 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 25 treesize of output 13 [2024-11-09 15:26:42,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 25 treesize of output 13 [2024-11-09 15:26:42,133 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 25 treesize of output 13 [2024-11-09 15:26:42,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 25 treesize of output 13 [2024-11-09 15:26:42,275 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 25 treesize of output 13 [2024-11-09 15:26:42,341 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 25 treesize of output 13 [2024-11-09 15:26:42,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 15:26:42,474 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 25 treesize of output 13 [2024-11-09 15:26:42,534 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 25 treesize of output 13 [2024-11-09 15:26:42,604 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 25 treesize of output 13 [2024-11-09 15:26:42,670 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 25 treesize of output 13 [2024-11-09 15:26:42,742 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 25 treesize of output 13 [2024-11-09 15:26:42,826 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 25 treesize of output 13 [2024-11-09 15:26:42,906 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 25 treesize of output 13 [2024-11-09 15:26:42,972 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 25 treesize of output 13 [2024-11-09 15:26:43,049 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 25 treesize of output 13 [2024-11-09 15:26:43,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 15:26:43,220 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 25 treesize of output 13 [2024-11-09 15:26:43,305 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 25 treesize of output 13 [2024-11-09 15:26:43,375 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 25 treesize of output 13 [2024-11-09 15:26:43,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 15:26:43,473 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-09 15:26:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:43,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:26:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:45,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029044515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:26:45,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:26:45,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 25] total 78 [2024-11-09 15:26:45,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937442438] [2024-11-09 15:26:45,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:26:45,495 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:26:45,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 6 times [2024-11-09 15:26:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600293672] [2024-11-09 15:26:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 15:26:45,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972264774] [2024-11-09 15:26:45,502 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:26:45,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:45,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:45,504 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-09 15:26:45,505 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-09 15:26:45,575 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-09 15:26:45,575 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 15:26:45,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:45,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:46,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2024-11-09 15:26:46,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2481, Invalid=3681, Unknown=0, NotChecked=0, Total=6162 [2024-11-09 15:26:46,376 INFO L87 Difference]: Start difference. First operand 166 states and 169 transitions. cyclomatic complexity: 5 Second operand has 79 states, 78 states have (on average 6.089743589743589) internal successors, (475), 79 states have internal predecessors, (475), 0 states have call successors, (0), 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-09 15:26:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:48,859 INFO L93 Difference]: Finished difference Result 484 states and 487 transitions. [2024-11-09 15:26:48,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 484 states and 487 transitions. [2024-11-09 15:26:48,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:26:48,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 484 states to 340 states and 343 transitions. [2024-11-09 15:26:48,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:26:48,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:26:48,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 343 transitions. [2024-11-09 15:26:48,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:48,867 INFO L218 hiAutomatonCegarLoop]: Abstraction has 340 states and 343 transitions. [2024-11-09 15:26:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 343 transitions. [2024-11-09 15:26:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 334. [2024-11-09 15:26:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 334 states have (on average 1.0089820359281436) internal successors, (337), 333 states have internal predecessors, (337), 0 states have call successors, (0), 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-09 15:26:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 337 transitions. [2024-11-09 15:26:48,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 334 states and 337 transitions. [2024-11-09 15:26:48,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-09 15:26:48,888 INFO L425 stractBuchiCegarLoop]: Abstraction has 334 states and 337 transitions. [2024-11-09 15:26:48,888 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:26:48,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 334 states and 337 transitions. [2024-11-09 15:26:48,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:26:48,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:48,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:48,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 47, 46, 46, 46, 46, 46, 1, 1, 1] [2024-11-09 15:26:48,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:48,899 INFO L745 eck$LassoCheckResult]: Stem: 3571#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3572#L-1 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#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 3568#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3569#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3561#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3562#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3573#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3886#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3885#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3884#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3567#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3563#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3564#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3559#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3560#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3555#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3556#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3570#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3883#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3882#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3881#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3880#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3879#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3878#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3877#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3876#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3875#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3874#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3873#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3872#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3871#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3870#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3869#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3868#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3867#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3866#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3865#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3864#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3863#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3862#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3861#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3860#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3859#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3858#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3857#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3856#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3855#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3854#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3853#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3852#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3851#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3850#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3849#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3848#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3847#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3846#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3845#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3844#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3843#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3842#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3841#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3840#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3839#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3838#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3837#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3836#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3835#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3834#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3833#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3832#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3831#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3830#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3829#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3828#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3827#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3826#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3825#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3824#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3823#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3822#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3821#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3820#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3819#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3818#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3817#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3816#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3815#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3814#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3813#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3812#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3811#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3810#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3809#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3808#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3807#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3806#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3805#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3804#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3803#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3802#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3801#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3800#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3799#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3798#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3797#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3796#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3795#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3794#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3793#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3792#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3791#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3790#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3789#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3788#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3787#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3786#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3785#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3784#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3783#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3782#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3781#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3780#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3779#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3778#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3777#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3776#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3775#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3774#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3773#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3772#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3771#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3770#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3769#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3768#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3767#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3766#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3765#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3764#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3763#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3762#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3761#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3760#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3759#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3758#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3757#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3756#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3755#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3754#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3753#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3752#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3751#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3750#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3749#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3748#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3747#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3746#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3745#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3744#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3743#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3742#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3741#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3740#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3739#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3738#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3737#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3736#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3735#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3734#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3733#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3732#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3731#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3730#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3729#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3728#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3727#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3726#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3725#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3724#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3723#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3722#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3721#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3720#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3719#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3718#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3717#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3716#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3715#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3714#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3713#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3712#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3711#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3710#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3709#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3708#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3707#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3706#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3705#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3704#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3703#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3702#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3701#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3700#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3699#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3698#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3697#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3696#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3695#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3694#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3693#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3692#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3691#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3690#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3689#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3688#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3687#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3686#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3685#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3684#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3683#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3682#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3681#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3680#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3679#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3678#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3677#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3676#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3675#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3674#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3673#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3672#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3671#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3670#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3669#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3668#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3667#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3666#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3665#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3664#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3663#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3662#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3661#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3660#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3659#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3658#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3657#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3656#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3655#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3654#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3653#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3652#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3651#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3650#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3649#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3648#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3647#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3646#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3645#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3644#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3643#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3642#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3641#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3640#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3639#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3638#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3637#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3636#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3635#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3634#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3633#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3632#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3631#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3630#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3629#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3628#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3627#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3626#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3625#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3624#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3623#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3622#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3621#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3620#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3619#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3618#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3617#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3616#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3615#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3614#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3613#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3612#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3611#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3610#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3609#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3608#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3607#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3606#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3605#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3604#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3603#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3602#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3601#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3600#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3599#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3598#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3597#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3596#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3595#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3594#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3593#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3592#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3591#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3590#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3589#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3588#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3582#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3587#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3586#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3585#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3584#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3583#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 3581#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3557#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 3558#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3553#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3554#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3565#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3566#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 3574#L561-2 [2024-11-09 15:26:48,902 INFO L747 eck$LassoCheckResult]: Loop: 3574#L561-2 call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3580#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#2(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; 3579#L565-2 call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3578#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 3577#L556-2 assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4); 3576#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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(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#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3575#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(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; 3574#L561-2 [2024-11-09 15:26:48,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash -605953493, now seen corresponding path program 5 times [2024-11-09 15:26:48,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:48,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899204697] [2024-11-09 15:26:48,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:48,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat