./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc 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/array-industry-pattern/array_monotonic.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:23:29,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:23:29,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:23:29,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:23:29,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:23:29,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:23:29,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:23:29,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:23:29,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:23:29,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:23:29,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:23:29,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:23:29,742 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:23:29,742 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:23:29,743 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:23:29,743 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:23:29,743 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:23:29,744 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:23:29,744 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:23:29,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:23:29,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:23:29,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:23:29,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:23:29,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:23:29,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:23:29,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:23:29,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:23:29,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:23:29,747 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:23:29,747 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:23:29,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:23:29,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:23:29,748 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:23:29,748 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:23:29,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:23:29,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:23:29,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:23:29,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:23:29,753 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:23:29,754 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2024-11-19 14:23:29,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:23:30,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:23:30,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:23:30,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:23:30,023 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:23:30,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2024-11-19 14:23:31,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:23:31,688 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:23:31,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2024-11-19 14:23:31,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1eceecb/4e88e79c29cc4bd0af05bdfb2ab3a8cb/FLAGb90c7c406 [2024-11-19 14:23:32,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1eceecb/4e88e79c29cc4bd0af05bdfb2ab3a8cb [2024-11-19 14:23:32,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:23:32,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:23:32,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:23:32,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:23:32,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:23:32,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3728264a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32, skipping insertion in model container [2024-11-19 14:23:32,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:23:32,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:23:32,287 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:23:32,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:23:32,316 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:23:32,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32 WrapperNode [2024-11-19 14:23:32,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:23:32,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:23:32,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:23:32,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:23:32,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,349 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2024-11-19 14:23:32,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:23:32,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:23:32,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:23:32,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:23:32,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,374 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-19 14:23:32,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:23:32,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:23:32,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:23:32,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:23:32,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:32,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:32,422 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-19 14:23:32,428 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-19 14:23:32,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:23:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:23:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 14:23:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 14:23:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:23:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:23:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:23:32,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 14:23:32,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:23:32,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:23:32,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:23:32,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:23:32,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 14:23:32,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:23:32,558 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:23:32,560 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:23:32,729 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-19 14:23:32,729 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:23:32,761 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:23:32,761 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:23:32,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:23:32 BoogieIcfgContainer [2024-11-19 14:23:32,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:23:32,766 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:23:32,766 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:23:32,770 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:23:32,772 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:32,772 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:23:32" (1/3) ... [2024-11-19 14:23:32,773 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@596fbca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:23:32, skipping insertion in model container [2024-11-19 14:23:32,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:32,773 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (2/3) ... [2024-11-19 14:23:32,774 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@596fbca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:23:32, skipping insertion in model container [2024-11-19 14:23:32,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:32,774 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:23:32" (3/3) ... [2024-11-19 14:23:32,776 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2024-11-19 14:23:32,840 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:23:32,840 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:23:32,840 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:23:32,840 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:23:32,840 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:23:32,840 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:23:32,840 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:23:32,841 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:23:32,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:32,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:23:32,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:32,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:32,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:23:32,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:32,861 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:23:32,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:32,863 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:23:32,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:32,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:32,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:23:32,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:32,871 INFO L745 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 12#L20-3true [2024-11-19 14:23:32,871 INFO L747 eck$LassoCheckResult]: Loop: 12#L20-3true assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 16#L23true assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int#1(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 13#L20-2true main_~i~0#1 := 2 + main_~i~0#1; 12#L20-3true [2024-11-19 14:23:32,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:32,876 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:23:32,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:32,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741820281] [2024-11-19 14:23:32,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:32,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:32,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:33,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:33,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2024-11-19 14:23:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:33,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303461735] [2024-11-19 14:23:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:33,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:33,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:33,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2024-11-19 14:23:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:33,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187374365] [2024-11-19 14:23:33,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:33,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:33,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:33,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:33,599 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:33,600 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:33,600 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:33,600 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:33,601 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:33,601 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:33,601 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:33,601 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:33,602 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2024-11-19 14:23:33,602 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:33,602 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:33,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:34,152 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:34,158 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:34,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,163 INFO L229 MonitoredProcess]: Starting monitored process 2 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-19 14:23:34,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:23:34,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:34,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:34,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,214 INFO L229 MonitoredProcess]: Starting monitored process 3 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-19 14:23:34,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:23:34,218 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-19 14:23:34,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 14:23:34,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,262 INFO L229 MonitoredProcess]: Starting monitored process 4 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-19 14:23:34,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:23:34,264 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-19 14:23:34,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:34,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:34,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:34,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 14:23:34,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,297 INFO L229 MonitoredProcess]: Starting monitored process 5 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-19 14:23:34,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:23:34,300 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-19 14:23:34,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:34,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:34,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:34,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:23:34,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,339 INFO L229 MonitoredProcess]: Starting monitored process 6 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-19 14:23:34,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:23:34,341 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-19 14:23:34,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:34,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:34,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:34,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:34,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,377 INFO L229 MonitoredProcess]: Starting monitored process 7 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-19 14:23:34,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:23:34,380 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-19 14:23:34,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:34,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:34,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:34,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:34,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,413 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-19 14:23:34,415 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-19 14:23:34,416 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-19 14:23:34,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,450 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-19 14:23:34,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,453 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-19 14:23:34,455 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-19 14:23:34,456 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-19 14:23:34,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:23:34,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,500 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-19 14:23:34,501 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-19 14:23:34,502 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-19 14:23:34,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:34,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,543 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-19 14:23:34,544 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-19 14:23:34,546 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-19 14:23:34,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-19 14:23:34,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,583 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-19 14:23:34,584 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-19 14:23:34,585 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-19 14:23:34,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:34,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:34,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:34,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:34,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,612 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-19 14:23:34,613 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-19 14:23:34,614 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-19 14:23:34,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,650 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-19 14:23:34,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,653 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-19 14:23:34,654 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-19 14:23:34,656 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-19 14:23:34,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-19 14:23:34,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,694 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-19 14:23:34,697 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-19 14:23:34,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:34,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:23:34,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,737 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-19 14:23:34,740 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-19 14:23:34,741 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-19 14:23:34,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:34,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:34,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:34,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,772 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-19 14:23:34,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,775 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-19 14:23:34,776 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-19 14:23:34,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-19 14:23:34,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,811 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:34,851 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-19 14:23:34,851 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-19 14:23:34,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,875 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-19 14:23:34,878 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-19 14:23:34,880 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:34,894 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:23:34,894 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:34,895 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 100000 Supporting invariants [] [2024-11-19 14:23:34,910 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-19 14:23:34,942 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-19 14:23:34,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:34,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:23:34,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:35,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:23:35,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:35,041 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-19 14:23:35,073 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-19 14:23:35,075 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-19 14:23:35,118 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 34 states and 49 transitions. Complement of second has 6 states. [2024-11-19 14:23:35,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-19 14:23:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-19 14:23:35,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-19 14:23:35,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:35,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-19 14:23:35,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:35,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-19 14:23:35,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:35,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2024-11-19 14:23:35,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:35,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 15 states and 21 transitions. [2024-11-19 14:23:35,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:23:35,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:23:35,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2024-11-19 14:23:35,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:35,137 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-11-19 14:23:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2024-11-19 14:23:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-19 14:23:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2024-11-19 14:23:35,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-11-19 14:23:35,167 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-11-19 14:23:35,167 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:23:35,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2024-11-19 14:23:35,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:35,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:35,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:35,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:23:35,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:35,170 INFO L745 eck$LassoCheckResult]: Stem: 137#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 126#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 127#L20-3 assume !(main_~i~0#1 < 100000); 128#L20-4 main_~i~0#1 := 0; 129#L26-3 [2024-11-19 14:23:35,170 INFO L747 eck$LassoCheckResult]: Loop: 129#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 136#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 125#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 129#L26-3 [2024-11-19 14:23:35,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:35,171 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2024-11-19 14:23:35,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:35,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302890097] [2024-11-19 14:23:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:35,257 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-19 14:23:35,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:35,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302890097] [2024-11-19 14:23:35,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302890097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:35,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:23:35,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:23:35,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040913870] [2024-11-19 14:23:35,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:35,260 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:35,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 1 times [2024-11-19 14:23:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:35,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677931739] [2024-11-19 14:23:35,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:35,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:35,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:35,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:35,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:35,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:23:35,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:23:35,337 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-19 14:23:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:35,363 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-11-19 14:23:35,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2024-11-19 14:23:35,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:23:35,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 24 transitions. [2024-11-19 14:23:35,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-19 14:23:35,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-19 14:23:35,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2024-11-19 14:23:35,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:35,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-19 14:23:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2024-11-19 14:23:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2024-11-19 14:23:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-11-19 14:23:35,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-19 14:23:35,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:23:35,372 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-19 14:23:35,375 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:23:35,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2024-11-19 14:23:35,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:23:35,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:35,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:35,376 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:35,376 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:35,376 INFO L745 eck$LassoCheckResult]: Stem: 177#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 178#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 171#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 172#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 175#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 173#L20-3 assume !(main_~i~0#1 < 100000); 174#L20-4 main_~i~0#1 := 0; 170#L26-3 [2024-11-19 14:23:35,376 INFO L747 eck$LassoCheckResult]: Loop: 170#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 176#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 169#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 170#L26-3 [2024-11-19 14:23:35,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:35,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767318, now seen corresponding path program 1 times [2024-11-19 14:23:35,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:35,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829769892] [2024-11-19 14:23:35,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:35,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:35,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829769892] [2024-11-19 14:23:35,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829769892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:35,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791544768] [2024-11-19 14:23:35,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:35,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:35,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:35,460 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:35,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 14:23:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:35,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 14:23:35,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:35,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:35,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791544768] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:35,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:35,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 14:23:35,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997669157] [2024-11-19 14:23:35,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:35,560 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:35,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 2 times [2024-11-19 14:23:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:35,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309095423] [2024-11-19 14:23:35,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:35,569 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:35,569 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:35,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:35,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:35,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:35,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 14:23:35,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 14:23:35,623 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:35,692 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-11-19 14:23:35,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2024-11-19 14:23:35,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:23:35,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2024-11-19 14:23:35,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-19 14:23:35,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-19 14:23:35,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2024-11-19 14:23:35,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:35,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-19 14:23:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2024-11-19 14:23:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2024-11-19 14:23:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-19 14:23:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-19 14:23:35,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-19 14:23:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:23:35,702 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-19 14:23:35,702 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:23:35,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-11-19 14:23:35,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:23:35,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:35,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:35,717 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1] [2024-11-19 14:23:35,719 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:35,719 INFO L745 eck$LassoCheckResult]: Stem: 273#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 266#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 267#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 282#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 268#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 269#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 270#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 271#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 281#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 280#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 279#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 277#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 278#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 276#L20-3 assume !(main_~i~0#1 < 100000); 275#L20-4 main_~i~0#1 := 0; 265#L26-3 [2024-11-19 14:23:35,720 INFO L747 eck$LassoCheckResult]: Loop: 265#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 272#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 264#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 265#L26-3 [2024-11-19 14:23:35,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:35,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1825864560, now seen corresponding path program 2 times [2024-11-19 14:23:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:35,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692643730] [2024-11-19 14:23:35,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:35,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:35,761 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:35,762 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:35,763 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-19 14:23:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:35,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:35,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692643730] [2024-11-19 14:23:35,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692643730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:35,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420178327] [2024-11-19 14:23:35,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:35,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:35,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:35,933 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:35,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-19 14:23:35,999 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:36,000 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:36,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:23:36,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:36,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420178327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:36,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:36,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-19 14:23:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356346713] [2024-11-19 14:23:36,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:36,119 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:36,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:36,119 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 3 times [2024-11-19 14:23:36,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:36,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088133686] [2024-11-19 14:23:36,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:36,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:36,127 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:23:36,127 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:36,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:36,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:36,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:36,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 14:23:36,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 14:23:36,186 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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-19 14:23:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:36,331 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2024-11-19 14:23:36,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 106 transitions. [2024-11-19 14:23:36,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:23:36,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 106 transitions. [2024-11-19 14:23:36,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-19 14:23:36,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-19 14:23:36,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 106 transitions. [2024-11-19 14:23:36,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:36,338 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 106 transitions. [2024-11-19 14:23:36,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 106 transitions. [2024-11-19 14:23:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 39. [2024-11-19 14:23:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 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-19 14:23:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-19 14:23:36,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-19 14:23:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 14:23:36,345 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-19 14:23:36,345 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:23:36,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2024-11-19 14:23:36,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:23:36,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:36,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:36,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1] [2024-11-19 14:23:36,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:36,347 INFO L745 eck$LassoCheckResult]: Stem: 485#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 486#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 478#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 479#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 487#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 480#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 481#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 482#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 483#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 512#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 511#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 510#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 509#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 508#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 507#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 506#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 505#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 504#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 503#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 502#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 501#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 500#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 499#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 498#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 497#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 496#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 495#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 494#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 493#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 492#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 490#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 491#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 489#L20-3 assume !(main_~i~0#1 < 100000); 488#L20-4 main_~i~0#1 := 0; 477#L26-3 [2024-11-19 14:23:36,347 INFO L747 eck$LassoCheckResult]: Loop: 477#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 484#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 476#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 477#L26-3 [2024-11-19 14:23:36,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1205177520, now seen corresponding path program 3 times [2024-11-19 14:23:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:36,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331934257] [2024-11-19 14:23:36,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:36,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:36,394 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 14:23:36,394 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:36,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331934257] [2024-11-19 14:23:36,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331934257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:36,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123877204] [2024-11-19 14:23:36,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:36,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:36,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:36,648 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:36,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-19 14:23:36,768 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 14:23:36,769 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:36,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:23:36,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:36,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:37,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123877204] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:37,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:37,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-19 14:23:37,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232416241] [2024-11-19 14:23:37,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:37,151 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:37,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 4 times [2024-11-19 14:23:37,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:37,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487030443] [2024-11-19 14:23:37,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:37,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:37,159 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:37,159 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:37,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:37,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:37,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 14:23:37,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-19 14:23:37,216 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 14 Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 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-19 14:23:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:37,501 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2024-11-19 14:23:37,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 226 transitions. [2024-11-19 14:23:37,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:23:37,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 181 states and 226 transitions. [2024-11-19 14:23:37,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2024-11-19 14:23:37,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2024-11-19 14:23:37,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 226 transitions. [2024-11-19 14:23:37,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:37,513 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 226 transitions. [2024-11-19 14:23:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 226 transitions. [2024-11-19 14:23:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 75. [2024-11-19 14:23:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2024-11-19 14:23:37,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 99 transitions. [2024-11-19 14:23:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 14:23:37,527 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 99 transitions. [2024-11-19 14:23:37,527 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:23:37,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 99 transitions. [2024-11-19 14:23:37,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:23:37,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:37,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:37,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1, 1, 1] [2024-11-19 14:23:37,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:37,534 INFO L745 eck$LassoCheckResult]: Stem: 932#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 933#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 924#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 925#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 931#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 926#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 927#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 928#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 929#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 994#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 993#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 992#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 991#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 990#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 989#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 988#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 987#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 986#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 985#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 984#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 983#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 982#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 981#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 980#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 979#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 978#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 977#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 976#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 975#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 974#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 973#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 972#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 971#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 970#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 969#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 968#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 967#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 966#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 965#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 964#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 963#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 962#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 961#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 960#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 959#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 958#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 957#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 956#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 955#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 954#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 953#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 952#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 951#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 950#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 949#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 948#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 947#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 946#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 945#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 944#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 943#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 942#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 941#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 940#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 939#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 938#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 936#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 937#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 935#L20-3 assume !(main_~i~0#1 < 100000); 934#L20-4 main_~i~0#1 := 0; 923#L26-3 [2024-11-19 14:23:37,534 INFO L747 eck$LassoCheckResult]: Loop: 923#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 930#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 922#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 923#L26-3 [2024-11-19 14:23:37,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:37,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1121042640, now seen corresponding path program 4 times [2024-11-19 14:23:37,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:37,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408358082] [2024-11-19 14:23:37,535 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:37,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:37,584 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:37,585 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:38,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:38,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408358082] [2024-11-19 14:23:38,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408358082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:38,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631144233] [2024-11-19 14:23:38,251 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:38,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:38,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:38,259 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:38,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-19 14:23:38,382 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:38,382 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:38,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 14:23:38,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:38,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:39,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631144233] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:39,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:39,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-11-19 14:23:39,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047687870] [2024-11-19 14:23:39,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:39,319 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 5 times [2024-11-19 14:23:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594754861] [2024-11-19 14:23:39,320 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:39,324 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:39,324 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:39,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:39,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:39,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-19 14:23:39,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-19 14:23:39,364 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. cyclomatic complexity: 26 Second operand has 48 states, 48 states have (on average 2.875) internal successors, (138), 48 states have internal predecessors, (138), 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-19 14:23:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:39,987 INFO L93 Difference]: Finished difference Result 373 states and 466 transitions. [2024-11-19 14:23:39,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 466 transitions. [2024-11-19 14:23:39,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:23:39,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 466 transitions. [2024-11-19 14:23:39,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2024-11-19 14:23:39,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2024-11-19 14:23:39,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 466 transitions. [2024-11-19 14:23:39,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:39,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 373 states and 466 transitions. [2024-11-19 14:23:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 466 transitions. [2024-11-19 14:23:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 147. [2024-11-19 14:23:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 states have internal predecessors, (195), 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-19 14:23:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 195 transitions. [2024-11-19 14:23:40,004 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 195 transitions. [2024-11-19 14:23:40,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-19 14:23:40,005 INFO L425 stractBuchiCegarLoop]: Abstraction has 147 states and 195 transitions. [2024-11-19 14:23:40,005 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:23:40,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 195 transitions. [2024-11-19 14:23:40,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:23:40,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:40,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:40,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1, 1, 1] [2024-11-19 14:23:40,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:40,010 INFO L745 eck$LassoCheckResult]: Stem: 1845#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 1846#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1839#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1840#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1844#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1841#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1842#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1837#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1838#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1979#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1978#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1977#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1976#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1975#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1974#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1973#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1972#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1971#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1970#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1969#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1968#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1967#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1966#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1965#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1964#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1963#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1962#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1961#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1960#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1959#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1958#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1957#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1956#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1955#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1954#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1953#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1952#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1951#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1950#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1949#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1948#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1947#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1946#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1945#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1944#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1943#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1942#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1941#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1940#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1939#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1938#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1937#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1936#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1935#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1934#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1933#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1932#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1931#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1930#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1929#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1928#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1927#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1926#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1925#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1924#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1923#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1922#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1921#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1920#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1919#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1918#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1917#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1916#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1915#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1914#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1913#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1912#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1911#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1910#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1909#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1908#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1907#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1906#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1905#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1904#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1903#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1902#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1901#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1900#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1899#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1898#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1897#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1896#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1895#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1894#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1893#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1892#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1891#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1890#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1889#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1888#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1887#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1886#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1885#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1884#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1883#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1882#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1881#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1880#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1879#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1878#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1877#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1876#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1875#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1874#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1873#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1872#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1871#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1870#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1869#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1868#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1867#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1866#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1865#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1864#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1863#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1862#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1861#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1860#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1859#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1858#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1857#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1856#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1855#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1854#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1853#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1852#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1851#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1849#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1850#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1848#L20-3 assume !(main_~i~0#1 < 100000); 1847#L20-4 main_~i~0#1 := 0; 1836#L26-3 [2024-11-19 14:23:40,011 INFO L747 eck$LassoCheckResult]: Loop: 1836#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1843#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1835#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1836#L26-3 [2024-11-19 14:23:40,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1788222416, now seen corresponding path program 5 times [2024-11-19 14:23:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:40,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170478838] [2024-11-19 14:23:40,012 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:40,146 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-19 14:23:40,147 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170478838] [2024-11-19 14:23:42,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170478838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728177263] [2024-11-19 14:23:42,206 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,208 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-19 14:24:26,169 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-19 14:24:26,170 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:24:26,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-19 14:24:26,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:24:26,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:24:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:24:29,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728177263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:24:29,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:24:29,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2024-11-19 14:24:29,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208300934] [2024-11-19 14:24:29,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:24:29,076 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:24:29,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 6 times [2024-11-19 14:24:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:24:29,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861712511] [2024-11-19 14:24:29,077 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:24:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:24:29,082 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:24:29,082 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:24:29,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:24:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:24:29,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:24:29,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:24:29,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-19 14:24:29,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-19 14:24:29,131 INFO L87 Difference]: Start difference. First operand 147 states and 195 transitions. cyclomatic complexity: 50 Second operand has 96 states, 96 states have (on average 2.9375) internal successors, (282), 96 states have internal predecessors, (282), 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-19 14:24:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:24:31,423 INFO L93 Difference]: Finished difference Result 757 states and 946 transitions. [2024-11-19 14:24:31,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 757 states and 946 transitions. [2024-11-19 14:24:31,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:24:31,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 757 states to 757 states and 946 transitions. [2024-11-19 14:24:31,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 475 [2024-11-19 14:24:31,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 475 [2024-11-19 14:24:31,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 757 states and 946 transitions. [2024-11-19 14:24:31,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:24:31,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 757 states and 946 transitions. [2024-11-19 14:24:31,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states and 946 transitions. [2024-11-19 14:24:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 291. [2024-11-19 14:24:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 290 states have internal predecessors, (387), 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-19 14:24:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 387 transitions. [2024-11-19 14:24:31,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 291 states and 387 transitions. [2024-11-19 14:24:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-19 14:24:31,457 INFO L425 stractBuchiCegarLoop]: Abstraction has 291 states and 387 transitions. [2024-11-19 14:24:31,457 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:24:31,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 387 transitions. [2024-11-19 14:24:31,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:24:31,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:24:31,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:24:31,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1, 1, 1] [2024-11-19 14:24:31,466 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:24:31,467 INFO L745 eck$LassoCheckResult]: Stem: 3694#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 3695#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 3688#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3689#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3693#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3690#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3691#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3686#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3687#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3972#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3971#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3970#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3969#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3968#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3967#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3966#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3965#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3964#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3963#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3962#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3961#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3960#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3959#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3958#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3957#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3956#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3955#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3954#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3953#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3952#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3951#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3950#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3949#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3948#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3947#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3946#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3945#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3944#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3943#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3942#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3941#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3940#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3939#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3938#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3937#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3936#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3935#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3934#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3933#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3932#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3931#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3930#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3929#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3928#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3927#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3926#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3925#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3924#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3923#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3922#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3921#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3920#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3919#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3918#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3917#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3916#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3915#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3914#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3913#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3912#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3911#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3910#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3909#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3908#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3907#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3906#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3905#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3904#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3903#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3902#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3901#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3900#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3899#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3898#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3897#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3896#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3895#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3894#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3893#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3892#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3891#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3890#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3889#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3888#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3887#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3886#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3885#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3884#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3883#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3882#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3881#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3880#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3879#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3878#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3877#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3876#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3875#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3874#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3873#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3872#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3871#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3870#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3869#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3868#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3867#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3866#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3865#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3864#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3863#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3862#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3861#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3860#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3859#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3858#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3857#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3856#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3855#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3854#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3853#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3852#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3851#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3850#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3849#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3848#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3847#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3846#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3845#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3844#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3843#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3842#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3841#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3840#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3839#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3838#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3837#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3836#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3835#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3834#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3833#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3832#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3831#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3830#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3829#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3828#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3827#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3826#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3825#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3824#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3823#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3822#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3821#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3820#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3819#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3818#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3817#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3816#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3815#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3814#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3813#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3812#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3811#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3810#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3809#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3808#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3807#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3806#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3805#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3804#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3803#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3802#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3801#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3800#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3799#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3798#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3797#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3796#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3795#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3794#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3793#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3792#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3791#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3790#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3789#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3788#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3787#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3786#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3785#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3784#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3783#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3782#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3781#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3780#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3779#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3778#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3777#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3776#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3775#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3774#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3773#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3772#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3771#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3770#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3769#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3768#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3767#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3766#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3765#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3764#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3763#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3762#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3761#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3760#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3759#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3758#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3757#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3756#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3755#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3754#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3753#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3752#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3751#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3750#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3749#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3748#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3747#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3746#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3745#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3744#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3743#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3742#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3741#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3740#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3739#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3738#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3737#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3736#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3735#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3734#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3733#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3732#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3731#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3730#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3729#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3728#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3727#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3726#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3725#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3724#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3723#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3722#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3721#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3720#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3719#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3718#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3717#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3716#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3715#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3714#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3713#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3712#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3711#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3710#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3709#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3708#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3707#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3706#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3705#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3704#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3703#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3702#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3701#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3700#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3698#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3699#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3697#L20-3 assume !(main_~i~0#1 < 100000); 3696#L20-4 main_~i~0#1 := 0; 3685#L26-3 [2024-11-19 14:24:31,469 INFO L747 eck$LassoCheckResult]: Loop: 3685#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3692#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 3684#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 3685#L26-3 [2024-11-19 14:24:31,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash 712364496, now seen corresponding path program 6 times [2024-11-19 14:24:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:24:31,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106087545] [2024-11-19 14:24:31,470 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:24:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:24:31,819 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-11-19 14:24:31,820 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:24:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:24:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:24:38,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106087545] [2024-11-19 14:24:38,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106087545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:24:38,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619400378] [2024-11-19 14:24:38,093 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:24:38,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:24:38,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:38,096 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:24:38,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process