./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.dd.update-z3-fca748b-m [2024-11-20 22:18:53,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:18:53,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-20 22:18:53,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:18:53,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:18:53,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:18:53,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:18:53,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:18:53,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:18:53,731 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:18:53,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:18:53,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:18:53,733 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:18:53,733 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:18:53,733 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:18:53,733 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:18:53,733 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:18:53,734 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:18:53,734 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:18:53,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:18:53,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:18:53,737 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 22:18:53,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:18:53,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 22:18:53,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:18:53,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:18:53,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:18:53,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:18:53,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:18:53,739 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:18:53,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 22:18:53,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:18:53,739 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:18:53,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:18:53,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:18:53,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:18:53,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:18:53,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:18:53,740 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:18:53,740 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-20 22:18:53,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:18:53,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:18:53,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:18:53,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:18:53,970 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:18:53,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2024-11-20 22:18:55,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:18:55,433 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:18:55,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2024-11-20 22:18:55,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fed953b8/eaf1cb6427a446549655e40eb9bca83f/FLAG7fe6058b6 [2024-11-20 22:18:55,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fed953b8/eaf1cb6427a446549655e40eb9bca83f [2024-11-20 22:18:55,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:18:55,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:18:55,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:18:55,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:18:55,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:18:55,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:18:55" (1/1) ... [2024-11-20 22:18:55,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d31f63a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:55, skipping insertion in model container [2024-11-20 22:18:55,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:18:55" (1/1) ... [2024-11-20 22:18:55,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:18:56,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:18:56,018 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:18:56,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:18:56,043 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:18:56,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56 WrapperNode [2024-11-20 22:18:56,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:18:56,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:18:56,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:18:56,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:18:56,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,071 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2024-11-20 22:18:56,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:18:56,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:18:56,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:18:56,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:18:56,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,092 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-20 22:18:56,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:18:56,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:18:56,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:18:56,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:18:56,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (1/1) ... [2024-11-20 22:18:56,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:56,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:56,134 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-20 22:18:56,137 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-20 22:18:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 22:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 22:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 22:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 22:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 22:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 22:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 22:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 22:18:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:18:56,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:18:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 22:18:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 22:18:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 22:18:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 22:18:56,233 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:18:56,236 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:18:56,361 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 22:18:56,362 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:18:56,372 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:18:56,373 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 22:18:56,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:18:56 BoogieIcfgContainer [2024-11-20 22:18:56,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:18:56,374 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:18:56,375 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:18:56,379 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:18:56,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:18:56,380 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:18:55" (1/3) ... [2024-11-20 22:18:56,381 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@99aebfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:18:56, skipping insertion in model container [2024-11-20 22:18:56,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:18:56,381 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:18:56" (2/3) ... [2024-11-20 22:18:56,382 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@99aebfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:18:56, skipping insertion in model container [2024-11-20 22:18:56,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:18:56,382 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:18:56" (3/3) ... [2024-11-20 22:18:56,383 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2024-11-20 22:18:56,430 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:18:56,431 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:18:56,431 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:18:56,431 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:18:56,431 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:18:56,431 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:18:56,431 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:18:56,431 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:18:56,435 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-20 22:18:56,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-20 22:18:56,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:18:56,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:18:56,453 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:18:56,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:18:56,454 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:18:56,454 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-20 22:18:56,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-20 22:18:56,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:18:56,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:18:56,456 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:18:56,456 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:18:56,463 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-20 22:18:56,463 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-20 22:18:56,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:56,470 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-20 22:18:56,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:56,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881196625] [2024-11-20 22:18:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:56,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:56,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:56,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:56,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:56,647 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2024-11-20 22:18:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:56,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188008860] [2024-11-20 22:18:56,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:56,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:56,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:56,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:56,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2024-11-20 22:18:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:56,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039183859] [2024-11-20 22:18:56,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:56,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:56,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:57,105 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:18:57,105 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:18:57,106 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:18:57,106 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:18:57,106 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:18:57,106 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,106 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:18:57,106 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:18:57,106 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2024-11-20 22:18:57,106 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:18:57,107 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:18:57,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:57,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:57,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:57,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:57,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:57,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:57,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:57,511 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:18:57,517 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:18:57,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,521 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-20 22:18:57,522 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-20 22:18:57,523 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-20 22:18:57,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:57,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:57,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,556 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-20 22:18:57,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,559 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-20 22:18:57,561 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-20 22:18:57,562 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-20 22:18:57,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:57,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:57,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,584 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-20 22:18:57,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,587 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-20 22:18:57,588 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-20 22:18:57,589 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-20 22:18:57,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:18:57,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:18:57,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:18:57,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,610 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-20 22:18:57,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,613 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-20 22:18:57,614 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-20 22:18:57,617 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-20 22:18:57,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:18:57,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:18:57,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:18:57,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,636 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-20 22:18:57,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,640 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-20 22:18:57,641 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-20 22:18:57,641 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-20 22:18:57,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:18:57,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:18:57,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:18:57,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,661 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-20 22:18:57,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,667 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-20 22:18:57,668 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-20 22:18:57,669 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-20 22:18:57,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:18:57,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:18:57,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:18:57,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-20 22:18:57,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,691 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-20 22:18:57,692 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-20 22:18:57,693 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-20 22:18:57,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:57,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:57,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:57,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,720 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-20 22:18:57,721 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-20 22:18:57,722 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-20 22:18:57,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:57,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:57,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,744 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-20 22:18:57,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,747 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-20 22:18:57,766 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-20 22:18:57,768 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-20 22:18:57,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:57,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:57,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-20 22:18:57,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,795 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-20 22:18:57,796 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-20 22:18:57,797 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-20 22:18:57,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:57,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:57,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,825 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-20 22:18:57,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,828 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-20 22:18:57,829 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-20 22:18:57,830 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-20 22:18:57,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:18:57,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:18:57,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:18:57,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-20 22:18:57,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,850 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-20 22:18:57,852 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-20 22:18:57,853 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-20 22:18:57,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:57,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:57,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,877 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-20 22:18:57,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,880 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-20 22:18:57,881 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-20 22:18:57,883 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-20 22:18:57,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:57,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:57,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,908 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-20 22:18:57,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,911 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-20 22:18:57,912 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-20 22:18:57,914 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-20 22:18:57,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:57,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:57,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:57,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:57,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:57,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:57,943 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-20 22:18:57,947 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-20 22:18:57,947 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-20 22:18:57,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:57,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:57,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:57,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:57,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:57,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:57,976 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:18:58,000 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-20 22:18:58,000 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-20 22:18:58,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:58,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:58,027 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-20 22:18:58,028 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-20 22:18:58,030 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:18:58,045 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:18:58,045 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:18:58,046 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 25000*v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1 Supporting invariants [] [2024-11-20 22:18:58,052 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-20 22:18:58,078 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-20 22:18:58,088 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:18:58,089 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:18:58,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:58,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:18:58,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:58,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:18:58,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:58,179 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-20 22:18:58,207 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-20 22:18:58,209 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-20 22:18:58,267 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 40 states and 58 transitions. Complement of second has 10 states. [2024-11-20 22:18:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-20 22:18:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-20 22:18:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2024-11-20 22:18:58,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-20 22:18:58,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:18:58,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-20 22:18:58,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:18:58,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-20 22:18:58,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:18:58,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2024-11-20 22:18:58,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-20 22:18:58,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 22 states and 31 transitions. [2024-11-20 22:18:58,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-20 22:18:58,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-20 22:18:58,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2024-11-20 22:18:58,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:18:58,292 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-20 22:18:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2024-11-20 22:18:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-20 22:18:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:18:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2024-11-20 22:18:58,314 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-11-20 22:18:58,314 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-11-20 22:18:58,315 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:18:58,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2024-11-20 22:18:58,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-20 22:18:58,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:18:58,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:18:58,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-20 22:18:58,317 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:18:58,317 INFO L745 eck$LassoCheckResult]: Stem: 155#$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); 139#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; 140#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); 150#L23 [2024-11-20 22:18:58,317 INFO L747 eck$LassoCheckResult]: Loop: 150#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 146#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 147#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); 150#L23 [2024-11-20 22:18:58,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-20 22:18:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:58,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720984849] [2024-11-20 22:18:58,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:58,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:58,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:58,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:58,344 INFO L85 PathProgramCache]: Analyzing trace with hash 44743, now seen corresponding path program 1 times [2024-11-20 22:18:58,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:58,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301752374] [2024-11-20 22:18:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:58,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:58,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:58,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:58,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash 889663585, now seen corresponding path program 1 times [2024-11-20 22:18:58,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:58,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883884150] [2024-11-20 22:18:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:58,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:58,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:58,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:58,664 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:18:58,664 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:18:58,664 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:18:58,664 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:18:58,664 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:18:58,664 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:58,664 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:18:58,664 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:18:58,664 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration2_Lasso [2024-11-20 22:18:58,665 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:18:58,665 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:18:58,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:58,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:58,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:58,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:58,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:58,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:58,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:58,989 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:18:58,990 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:18:58,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:58,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:58,992 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-20 22:18:58,994 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-20 22:18:58,995 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-20 22:18:59,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:18:59,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:18:59,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:18:59,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,016 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-20 22:18:59,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,018 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-20 22:18:59,021 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-20 22:18:59,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:18:59,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:18:59,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:18:59,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,041 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-20 22:18:59,043 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-20 22:18:59,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:59,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:59,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,066 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-20 22:18:59,068 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-20 22:18:59,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:59,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:59,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-20 22:18:59,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,090 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-20 22:18:59,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:18:59,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:18:59,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:18:59,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:18:59,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,114 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-20 22:18:59,116 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-20 22:18:59,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:59,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:59,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,141 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-20 22:18:59,146 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-20 22:18:59,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:59,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:59,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,196 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-20 22:18:59,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,197 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-20 22:18:59,200 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-20 22:18:59,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,210 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-20 22:18:59,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,220 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-20 22:18:59,220 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-20 22:18:59,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,240 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-20 22:18:59,243 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-20 22:18:59,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:59,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:59,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,267 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-20 22:18:59,269 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-20 22:18:59,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:59,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:59,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,293 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-20 22:18:59,296 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-20 22:18:59,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:59,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:59,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,319 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-20 22:18:59,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:18:59,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:59,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:59,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,351 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-20 22:18:59,353 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-20 22:18:59,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:59,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:59,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,376 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-20 22:18:59,381 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-20 22:18:59,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:59,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:59,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:59,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,404 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-20 22:18:59,407 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-20 22:18:59,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:59,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:59,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:59,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:59,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:59,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:59,426 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:18:59,451 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-20 22:18:59,452 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-20 22:18:59,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:59,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,455 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-20 22:18:59,460 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:18:59,471 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:18:59,471 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:18:59,471 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 99998 Supporting invariants [] [2024-11-20 22:18:59,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:59,496 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-20 22:18:59,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:59,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:18:59,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:59,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:18:59,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:59,537 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-20 22:18:59,538 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-20 22:18:59,538 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-20 22:18:59,558 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 44 states and 60 transitions. Complement of second has 8 states. [2024-11-20 22:18:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-20 22:18:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-20 22:18:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2024-11-20 22:18:59,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 3 letters. [2024-11-20 22:18:59,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:18:59,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 6 letters. Loop has 3 letters. [2024-11-20 22:18:59,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:18:59,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 6 letters. [2024-11-20 22:18:59,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:18:59,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 60 transitions. [2024-11-20 22:18:59,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-20 22:18:59,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 31 states and 42 transitions. [2024-11-20 22:18:59,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-20 22:18:59,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-20 22:18:59,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2024-11-20 22:18:59,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:18:59,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-20 22:18:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2024-11-20 22:18:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-20 22:18:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 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-20 22:18:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2024-11-20 22:18:59,565 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2024-11-20 22:18:59,565 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2024-11-20 22:18:59,565 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:18:59,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. [2024-11-20 22:18:59,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-20 22:18:59,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:18:59,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:18:59,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-20 22:18:59,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:18:59,566 INFO L745 eck$LassoCheckResult]: Stem: 293#$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); 278#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; 279#L20-3 assume !(main_~i~0#1 < 100000); 280#L20-4 main_~i~0#1 := 0; 281#L26-3 [2024-11-20 22:18:59,567 INFO L747 eck$LassoCheckResult]: Loop: 281#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); 292#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 277#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 281#L26-3 [2024-11-20 22:18:59,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:59,567 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2024-11-20 22:18:59,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:59,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853509224] [2024-11-20 22:18:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:59,617 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-20 22:18:59,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:18:59,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853509224] [2024-11-20 22:18:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853509224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:18:59,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:18:59,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:18:59,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283037582] [2024-11-20 22:18:59,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:18:59,620 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:18:59,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 1 times [2024-11-20 22:18:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:59,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488459107] [2024-11-20 22:18:59,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:59,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:59,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:59,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:59,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:18:59,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:18:59,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:18:59,664 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. cyclomatic complexity: 15 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-20 22:18:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:18:59,683 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-11-20 22:18:59,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2024-11-20 22:18:59,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:18:59,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 42 transitions. [2024-11-20 22:18:59,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-20 22:18:59,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-20 22:18:59,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2024-11-20 22:18:59,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:18:59,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-20 22:18:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2024-11-20 22:18:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2024-11-20 22:18:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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-20 22:18:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2024-11-20 22:18:59,686 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-20 22:18:59,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:18:59,687 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-20 22:18:59,687 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:18:59,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2024-11-20 22:18:59,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:18:59,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:18:59,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:18:59,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:18:59,690 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:18:59,690 INFO L745 eck$LassoCheckResult]: Stem: 358#$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); 359#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; 348#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); 349#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 352#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 353#L20-3 assume !(main_~i~0#1 < 100000); 360#L20-4 main_~i~0#1 := 0; 347#L26-3 [2024-11-20 22:18:59,690 INFO L747 eck$LassoCheckResult]: Loop: 347#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); 356#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 346#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 347#L26-3 [2024-11-20 22:18:59,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767318, now seen corresponding path program 1 times [2024-11-20 22:18:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:59,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212472140] [2024-11-20 22:18:59,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:59,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:59,735 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-20 22:18:59,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:18:59,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212472140] [2024-11-20 22:18:59,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212472140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:18:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857486511] [2024-11-20 22:18:59,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:59,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:18:59,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,738 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:18:59,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-20 22:18:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:59,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 22:18:59,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:59,799 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-20 22:18:59,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:18:59,816 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-20 22:18:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857486511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:18:59,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:18:59,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 22:18:59,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997541496] [2024-11-20 22:18:59,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:18:59,817 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:18:59,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:59,817 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 2 times [2024-11-20 22:18:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:59,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011249554] [2024-11-20 22:18:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:59,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:59,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:59,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:18:59,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 22:18:59,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 22:18:59,859 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 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-20 22:18:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:18:59,901 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2024-11-20 22:18:59,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 89 transitions. [2024-11-20 22:18:59,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:18:59,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 78 transitions. [2024-11-20 22:18:59,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-20 22:18:59,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-20 22:18:59,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 78 transitions. [2024-11-20 22:18:59,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:18:59,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 78 transitions. [2024-11-20 22:18:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 78 transitions. [2024-11-20 22:18:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2024-11-20 22:18:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.3) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:18:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-20 22:18:59,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-20 22:18:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:18:59,908 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-20 22:18:59,909 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:18:59,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2024-11-20 22:18:59,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:18:59,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:18:59,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:18:59,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1] [2024-11-20 22:18:59,910 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:18:59,910 INFO L745 eck$LassoCheckResult]: Stem: 491#$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); 492#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; 482#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); 483#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 493#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 514#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); 510#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 508#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 506#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); 504#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 499#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 502#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); 498#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 487#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 488#L20-3 assume !(main_~i~0#1 < 100000); 496#L20-4 main_~i~0#1 := 0; 481#L26-3 [2024-11-20 22:18:59,910 INFO L747 eck$LassoCheckResult]: Loop: 481#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); 490#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 480#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 481#L26-3 [2024-11-20 22:18:59,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:59,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1825864560, now seen corresponding path program 2 times [2024-11-20 22:18:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:59,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601576061] [2024-11-20 22:18:59,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:59,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:59,996 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-20 22:18:59,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:18:59,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601576061] [2024-11-20 22:18:59,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601576061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:18:59,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182616148] [2024-11-20 22:18:59,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:18:59,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:18:59,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:59,999 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:19:00,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-20 22:19:00,040 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:19:00,040 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:19:00,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:19:00,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:00,069 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-20 22:19:00,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:19:00,128 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-20 22:19:00,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182616148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:19:00,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:19:00,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-20 22:19:00,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594671291] [2024-11-20 22:19:00,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:19:00,129 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:19:00,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 3 times [2024-11-20 22:19:00,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:00,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294809529] [2024-11-20 22:19:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:00,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:00,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:00,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:19:00,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 22:19:00,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-20 22:19:00,171 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 15 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-20 22:19:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:19:00,274 INFO L93 Difference]: Finished difference Result 158 states and 204 transitions. [2024-11-20 22:19:00,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 204 transitions. [2024-11-20 22:19:00,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:19:00,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 146 states and 180 transitions. [2024-11-20 22:19:00,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-11-20 22:19:00,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2024-11-20 22:19:00,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 180 transitions. [2024-11-20 22:19:00,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:19:00,278 INFO L218 hiAutomatonCegarLoop]: Abstraction has 146 states and 180 transitions. [2024-11-20 22:19:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 180 transitions. [2024-11-20 22:19:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 94. [2024-11-20 22:19:00,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 93 states have internal predecessors, (118), 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-20 22:19:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2024-11-20 22:19:00,286 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 118 transitions. [2024-11-20 22:19:00,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 22:19:00,287 INFO L425 stractBuchiCegarLoop]: Abstraction has 94 states and 118 transitions. [2024-11-20 22:19:00,287 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:19:00,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 118 transitions. [2024-11-20 22:19:00,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:19:00,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:00,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:00,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1] [2024-11-20 22:19:00,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:19:00,289 INFO L745 eck$LassoCheckResult]: Stem: 795#$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); 796#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; 786#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); 787#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 793#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 789#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); 790#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 873#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 872#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); 863#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 860#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 858#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); 856#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 855#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 854#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); 845#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 842#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 840#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); 837#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 835#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 832#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); 830#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 828#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 827#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); 818#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 815#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 813#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); 811#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 804#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 806#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); 805#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 791#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 792#L20-3 assume !(main_~i~0#1 < 100000); 799#L20-4 main_~i~0#1 := 0; 785#L26-3 [2024-11-20 22:19:00,289 INFO L747 eck$LassoCheckResult]: Loop: 785#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); 794#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 784#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 785#L26-3 [2024-11-20 22:19:00,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1205177520, now seen corresponding path program 3 times [2024-11-20 22:19:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:00,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755883857] [2024-11-20 22:19:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:00,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:00,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:00,498 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-20 22:19:00,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:19:00,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755883857] [2024-11-20 22:19:00,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755883857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:19:00,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839782479] [2024-11-20 22:19:00,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 22:19:00,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:19:00,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:00,501 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:19:00,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-20 22:19:00,597 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-20 22:19:00,597 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:19:00,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 22:19:00,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:00,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-20 22:19:00,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:19:00,855 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-20 22:19:00,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839782479] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:19:00,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:19:00,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-20 22:19:00,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120542794] [2024-11-20 22:19:00,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:19:00,856 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:19:00,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 4 times [2024-11-20 22:19:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:00,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102000906] [2024-11-20 22:19:00,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:00,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:00,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:00,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:00,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:19:00,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 22:19:00,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-20 22:19:00,891 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. cyclomatic complexity: 27 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-20 22:19:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:19:01,110 INFO L93 Difference]: Finished difference Result 338 states and 432 transitions. [2024-11-20 22:19:01,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 432 transitions. [2024-11-20 22:19:01,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:19:01,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 314 states and 384 transitions. [2024-11-20 22:19:01,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2024-11-20 22:19:01,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2024-11-20 22:19:01,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 384 transitions. [2024-11-20 22:19:01,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:19:01,114 INFO L218 hiAutomatonCegarLoop]: Abstraction has 314 states and 384 transitions. [2024-11-20 22:19:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 384 transitions. [2024-11-20 22:19:01,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 202. [2024-11-20 22:19:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 202 states have (on average 1.2376237623762376) internal successors, (250), 201 states have internal predecessors, (250), 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-20 22:19:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2024-11-20 22:19:01,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 250 transitions. [2024-11-20 22:19:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-20 22:19:01,123 INFO L425 stractBuchiCegarLoop]: Abstraction has 202 states and 250 transitions. [2024-11-20 22:19:01,123 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-20 22:19:01,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 202 states and 250 transitions. [2024-11-20 22:19:01,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:19:01,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:01,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:01,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1, 1, 1] [2024-11-20 22:19:01,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:19:01,126 INFO L745 eck$LassoCheckResult]: Stem: 1453#$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); 1454#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; 1444#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); 1445#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1451#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1447#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); 1448#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1455#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1640#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); 1638#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1637#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1636#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); 1634#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1633#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1632#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); 1630#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1629#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1628#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); 1626#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1625#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1624#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); 1622#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1621#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1620#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); 1618#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1616#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1615#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); 1606#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1603#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1601#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); 1591#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1588#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1586#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); 1576#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1573#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1571#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); 1561#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1559#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1557#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); 1548#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1546#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1544#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); 1537#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1534#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1532#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); 1525#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1523#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1520#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); 1508#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1506#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1504#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); 1502#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1498#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1496#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); 1493#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1491#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1488#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); 1484#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1481#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1478#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); 1474#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1471#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1468#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); 1466#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1461#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1464#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); 1460#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1449#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1450#L20-3 assume !(main_~i~0#1 < 100000); 1456#L20-4 main_~i~0#1 := 0; 1443#L26-3 [2024-11-20 22:19:01,126 INFO L747 eck$LassoCheckResult]: Loop: 1443#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); 1452#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1442#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1443#L26-3 [2024-11-20 22:19:01,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:01,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1121042640, now seen corresponding path program 4 times [2024-11-20 22:19:01,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:01,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720920495] [2024-11-20 22:19:01,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:01,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:01,629 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-20 22:19:01,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:19:01,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720920495] [2024-11-20 22:19:01,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720920495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:19:01,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821076932] [2024-11-20 22:19:01,630 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 22:19:01,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:19:01,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:01,632 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:19:01,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-20 22:19:01,718 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 22:19:01,719 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:19:01,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-20 22:19:01,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:01,820 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-20 22:19:01,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:19:02,468 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-20 22:19:02,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821076932] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:19:02,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:19:02,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-20 22:19:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431260116] [2024-11-20 22:19:02,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:19:02,469 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:19:02,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 5 times [2024-11-20 22:19:02,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:02,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644838600] [2024-11-20 22:19:02,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:02,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:02,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:02,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:02,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:19:02,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-20 22:19:02,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-20 22:19:02,511 INFO L87 Difference]: Start difference. First operand 202 states and 250 transitions. cyclomatic complexity: 51 Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 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-20 22:19:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:19:03,047 INFO L93 Difference]: Finished difference Result 698 states and 888 transitions. [2024-11-20 22:19:03,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 698 states and 888 transitions. [2024-11-20 22:19:03,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:19:03,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 698 states to 650 states and 792 transitions. [2024-11-20 22:19:03,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2024-11-20 22:19:03,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2024-11-20 22:19:03,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 650 states and 792 transitions. [2024-11-20 22:19:03,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:19:03,054 INFO L218 hiAutomatonCegarLoop]: Abstraction has 650 states and 792 transitions. [2024-11-20 22:19:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states and 792 transitions. [2024-11-20 22:19:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 418. [2024-11-20 22:19:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 418 states have (on average 1.229665071770335) internal successors, (514), 417 states have internal predecessors, (514), 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-20 22:19:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 514 transitions. [2024-11-20 22:19:03,067 INFO L240 hiAutomatonCegarLoop]: Abstraction has 418 states and 514 transitions. [2024-11-20 22:19:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-20 22:19:03,075 INFO L425 stractBuchiCegarLoop]: Abstraction has 418 states and 514 transitions. [2024-11-20 22:19:03,075 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-20 22:19:03,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 514 transitions. [2024-11-20 22:19:03,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:19:03,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:03,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:03,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1, 1, 1] [2024-11-20 22:19:03,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:19:03,080 INFO L745 eck$LassoCheckResult]: Stem: 2820#$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); 2821#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; 2810#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); 2811#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2822#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3219#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); 3215#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3212#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3209#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); 3206#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3203#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3200#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); 3197#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3194#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3191#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); 3188#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3185#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3182#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); 3179#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3176#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3173#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); 3170#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3167#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3164#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); 3161#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3158#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3156#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); 3153#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3150#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3147#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); 3144#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3140#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3137#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); 3134#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3131#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3128#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); 3125#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3122#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3119#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); 3116#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3113#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3110#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); 3107#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3104#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3101#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); 3098#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3095#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3092#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); 3089#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3086#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3083#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); 3080#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3077#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3074#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); 3071#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3068#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3065#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); 3062#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3059#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3056#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); 3053#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3050#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3047#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); 3044#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3041#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3038#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); 3035#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3032#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3029#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); 3026#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3023#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3020#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); 3017#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3015#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3014#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); 3012#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3011#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3010#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); 3008#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3007#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3006#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); 3004#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3003#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3002#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); 3000#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2999#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2998#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); 2996#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2995#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2994#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); 2992#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2991#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2990#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); 2989#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2985#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2983#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); 2979#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2976#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2974#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); 2970#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2967#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2965#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); 2962#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2958#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2956#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); 2946#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2943#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2941#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); 2932#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2929#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2927#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); 2917#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2914#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2912#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); 2903#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2901#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2899#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); 2890#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2888#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2886#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); 2879#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2876#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2874#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); 2865#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2863#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2861#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); 2859#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2858#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2857#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); 2849#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2846#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2843#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); 2839#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2837#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2835#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); 2833#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2828#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2831#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); 2827#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2815#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2816#L20-3 assume !(main_~i~0#1 < 100000); 2825#L20-4 main_~i~0#1 := 0; 2809#L26-3 [2024-11-20 22:19:03,080 INFO L747 eck$LassoCheckResult]: Loop: 2809#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); 2819#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 2808#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 2809#L26-3 [2024-11-20 22:19:03,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1788222416, now seen corresponding path program 5 times [2024-11-20 22:19:03,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:03,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527277743] [2024-11-20 22:19:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:04,764 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-20 22:19:04,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:19:04,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527277743] [2024-11-20 22:19:04,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527277743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:19:04,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334713820] [2024-11-20 22:19:04,765 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 22:19:04,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:19:04,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:04,767 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:19:04,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-20 22:19:56,403 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-20 22:19:56,404 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:19:56,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-20 22:19:56,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:56,603 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-20 22:19:56,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:19:58,734 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-20 22:19:58,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334713820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:19:58,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:19:58,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-11-20 22:19:58,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420334166] [2024-11-20 22:19:58,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:19:58,736 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:19:58,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 6 times [2024-11-20 22:19:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:58,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647060492] [2024-11-20 22:19:58,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:58,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:58,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:58,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:19:58,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-20 22:19:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-11-20 22:19:58,781 INFO L87 Difference]: Start difference. First operand 418 states and 514 transitions. cyclomatic complexity: 99 Second operand has 97 states, 97 states have (on average 2.948453608247423) internal successors, (286), 97 states have internal predecessors, (286), 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-20 22:20:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:20:01,053 INFO L93 Difference]: Finished difference Result 1418 states and 1800 transitions. [2024-11-20 22:20:01,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1418 states and 1800 transitions. [2024-11-20 22:20:01,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:20:01,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1418 states to 1322 states and 1608 transitions. [2024-11-20 22:20:01,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 571 [2024-11-20 22:20:01,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 571 [2024-11-20 22:20:01,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1322 states and 1608 transitions. [2024-11-20 22:20:01,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:20:01,067 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1322 states and 1608 transitions. [2024-11-20 22:20:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states and 1608 transitions. [2024-11-20 22:20:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 850. [2024-11-20 22:20:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 850 states have (on average 1.2258823529411764) internal successors, (1042), 849 states have internal predecessors, (1042), 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-20 22:20:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1042 transitions. [2024-11-20 22:20:01,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 850 states and 1042 transitions. [2024-11-20 22:20:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-20 22:20:01,093 INFO L425 stractBuchiCegarLoop]: Abstraction has 850 states and 1042 transitions. [2024-11-20 22:20:01,093 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-20 22:20:01,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1042 transitions. [2024-11-20 22:20:01,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-20 22:20:01,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:01,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:01,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1, 1, 1] [2024-11-20 22:20:01,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:20:01,100 INFO L745 eck$LassoCheckResult]: Stem: 5602#$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); 5603#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; 5592#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); 5593#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5604#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6433#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); 6429#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6426#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6423#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); 6420#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6417#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6414#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); 6411#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6408#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6405#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); 6402#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6399#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6396#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); 6393#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6390#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6387#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); 6384#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6381#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6378#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); 6375#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6372#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6369#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); 6366#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6363#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6360#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); 6357#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6354#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6352#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); 6349#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6346#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6343#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); 6340#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6336#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6333#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); 6330#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6327#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6324#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); 6321#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6318#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6315#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); 6312#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6309#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6306#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); 6303#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6300#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6297#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); 6294#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6291#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6288#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); 6285#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6282#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6279#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); 6276#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6273#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6270#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); 6267#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6264#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6261#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); 6258#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6255#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6252#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); 6249#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6246#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6243#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); 6240#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6237#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6234#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); 6231#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6228#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6225#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); 6222#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6219#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6216#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); 6213#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6210#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6208#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); 6205#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6202#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6199#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); 6196#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6192#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6189#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); 6186#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6183#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6180#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); 6177#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6174#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6171#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); 6168#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6165#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6162#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); 6159#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6156#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6153#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); 6150#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6147#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6144#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); 6141#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6138#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6135#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); 6132#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6129#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6126#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); 6123#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6120#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6117#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); 6114#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6111#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6108#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); 6105#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6102#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6099#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); 6096#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6093#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6090#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); 6087#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6084#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6081#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); 6078#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6075#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6072#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); 6069#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6066#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6064#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); 6061#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6058#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6055#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); 6052#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6048#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6045#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); 6042#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6039#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6036#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); 6033#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6030#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6027#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); 6024#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6021#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6018#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); 6015#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6012#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6009#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); 6006#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6003#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6000#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); 5997#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5994#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5991#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); 5988#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5985#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5983#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); 5980#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5977#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5974#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); 5971#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5967#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5964#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); 5961#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5958#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5956#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); 5953#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5950#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5947#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); 5944#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5940#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5937#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); 5934#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5931#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5928#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); 5925#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5922#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5919#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); 5916#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5913#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5910#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); 5907#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5904#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5901#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); 5898#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5895#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5892#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); 5889#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5886#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5883#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); 5880#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5877#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5874#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); 5871#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5868#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5865#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); 5862#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5859#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5856#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); 5853#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5850#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5847#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); 5844#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5841#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5839#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); 5836#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5833#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5830#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); 5827#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5823#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5820#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); 5817#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5814#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5812#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); 5809#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5806#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5803#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); 5800#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5796#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5793#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); 5790#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5787#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5784#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); 5781#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5778#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5775#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); 5772#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5769#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5766#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); 5763#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5760#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5757#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); 5754#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5751#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5748#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); 5745#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5742#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5739#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); 5736#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5733#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5730#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); 5727#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5724#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5721#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); 5718#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5715#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5712#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); 5709#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5706#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5703#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); 5700#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5697#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5695#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); 5693#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5692#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5691#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); 5690#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5687#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5684#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); 5681#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5679#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5676#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); 5671#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5668#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5665#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); 5663#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5659#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5656#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); 5647#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5645#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5643#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); 5641#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5640#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5639#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); 5631#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5628#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5625#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); 5621#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5619#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5617#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); 5615#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5610#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5613#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); 5609#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5597#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5598#L20-3 assume !(main_~i~0#1 < 100000); 5607#L20-4 main_~i~0#1 := 0; 5591#L26-3 [2024-11-20 22:20:01,101 INFO L747 eck$LassoCheckResult]: Loop: 5591#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); 5601#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 5590#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 5591#L26-3 [2024-11-20 22:20:01,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash 712364496, now seen corresponding path program 6 times [2024-11-20 22:20:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37875903] [2024-11-20 22:20:01,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:06,182 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-20 22:20:06,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:20:06,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37875903] [2024-11-20 22:20:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37875903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:20:06,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789899003] [2024-11-20 22:20:06,182 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-20 22:20:06,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:20:06,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:06,184 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:20:06,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process