./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_vararg_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 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-examples/standard_vararg_ground.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 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:19:22,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:19:22,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:19:22,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:19:22,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:19:22,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:19:22,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:19:22,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:19:22,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:19:22,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:19:22,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:19:22,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:19:22,303 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:19:22,303 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:19:22,303 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:19:22,303 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:19:22,304 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:19:22,304 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:19:22,304 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:19:22,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:19:22,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:19:22,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:19:22,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:19:22,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:19:22,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:19:22,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:19:22,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:19:22,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:19:22,308 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:19:22,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:19:22,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:19:22,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:19:22,309 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:19:22,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:19:22,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:19:22,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:19:22,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:19:22,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:19:22,310 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:19:22,311 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 -> 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 [2024-10-15 00:19:22,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:19:22,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:19:22,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:19:22,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:19:22,621 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:19:22,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_vararg_ground.i [2024-10-15 00:19:23,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:19:24,097 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:19:24,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_vararg_ground.i [2024-10-15 00:19:24,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a8c9a11/587eaafbe6eb4915819e0d10cf8fd046/FLAG7a9583617 [2024-10-15 00:19:24,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a8c9a11/587eaafbe6eb4915819e0d10cf8fd046 [2024-10-15 00:19:24,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:19:24,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:19:24,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:19:24,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:19:24,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:19:24,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f36471a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24, skipping insertion in model container [2024-10-15 00:19:24,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:19:24,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:19:24,370 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:19:24,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:19:24,394 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:19:24,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24 WrapperNode [2024-10-15 00:19:24,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:19:24,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:19:24,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:19:24,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:19:24,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,419 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2024-10-15 00:19:24,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:19:24,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:19:24,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:19:24,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:19:24,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,438 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-15 00:19:24,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:19:24,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:19:24,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:19:24,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:19:24,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (1/1) ... [2024-10-15 00:19:24,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:24,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:24,478 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-10-15 00:19:24,488 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-10-15 00:19:24,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 00:19:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 00:19:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 00:19:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 00:19:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:19:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 00:19:24,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:19:24,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:19:24,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:19:24,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 00:19:24,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:19:24,594 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:19:24,596 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:19:24,699 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-15 00:19:24,699 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:19:24,709 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:19:24,709 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-15 00:19:24,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:19:24 BoogieIcfgContainer [2024-10-15 00:19:24,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:19:24,710 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:19:24,711 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:19:24,714 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:19:24,714 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:19:24,715 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:19:24" (1/3) ... [2024-10-15 00:19:24,716 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@714448da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:19:24, skipping insertion in model container [2024-10-15 00:19:24,716 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:19:24,716 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:24" (2/3) ... [2024-10-15 00:19:24,716 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@714448da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:19:24, skipping insertion in model container [2024-10-15 00:19:24,716 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:19:24,716 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:19:24" (3/3) ... [2024-10-15 00:19:24,717 INFO L332 chiAutomizerObserver]: Analyzing ICFG standard_vararg_ground.i [2024-10-15 00:19:24,758 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:19:24,759 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:19:24,759 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:19:24,759 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:19:24,759 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:19:24,759 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:19:24,759 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:19:24,759 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:19:24,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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-10-15 00:19:24,779 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-15 00:19:24,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:24,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:24,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:19:24,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:19:24,784 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:19:24,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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-10-15 00:19:24,787 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-15 00:19:24,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:24,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:24,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:19:24,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:19:24,795 INFO L745 eck$LassoCheckResult]: Stem: 17#$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(25, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 14#L20-3true [2024-10-15 00:19:24,796 INFO L747 eck$LassoCheckResult]: Loop: 14#L20-3true assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 15#L20-2true main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 14#L20-3true [2024-10-15 00:19:24,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:24,805 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:19:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:24,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876876936] [2024-10-15 00:19:24,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:24,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:24,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:24,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:24,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-15 00:19:24,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:24,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586835908] [2024-10-15 00:19:24,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:24,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:24,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:24,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:24,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-15 00:19:24,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:24,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516046535] [2024-10-15 00:19:24,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:24,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:24,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:24,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:25,235 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:19:25,236 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:19:25,236 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:19:25,236 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:19:25,236 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:19:25,236 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,236 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:19:25,236 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:19:25,236 INFO L132 ssoRankerPreferences]: Filename of dumped script: standard_vararg_ground.i_Iteration1_Lasso [2024-10-15 00:19:25,237 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:19:25,237 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:19:25,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,626 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:19:25,630 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:19:25,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,638 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-10-15 00:19:25,647 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-10-15 00:19:25,650 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-10-15 00:19:25,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:25,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:25,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:25,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 00:19:25,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,705 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-10-15 00:19:25,712 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-10-15 00:19:25,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:25,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:25,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:25,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:25,750 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-10-15 00:19:25,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,753 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-10-15 00:19:25,755 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-10-15 00:19:25,763 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-10-15 00:19:25,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:25,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:25,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:25,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:25,814 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-10-15 00:19:25,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,816 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-10-15 00:19:25,822 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-10-15 00:19:25,823 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-10-15 00:19:25,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:25,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:25,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:25,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:25,871 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-10-15 00:19:25,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,876 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-10-15 00:19:25,878 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-10-15 00:19:25,882 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-10-15 00:19:25,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:25,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:25,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:25,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:25,920 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-10-15 00:19:25,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,922 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-10-15 00:19:25,923 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-10-15 00:19:25,924 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-10-15 00:19:25,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:25,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:25,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:25,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:25,951 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-10-15 00:19:25,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,955 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-10-15 00:19:25,963 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-10-15 00:19:25,964 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-10-15 00:19:25,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:25,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:25,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:25,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:25,989 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-10-15 00:19:25,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,991 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-10-15 00:19:25,992 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-10-15 00:19:25,993 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-10-15 00:19:26,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:26,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:26,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:26,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:26,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:26,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:26,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:26,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:26,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:26,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,025 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-10-15 00:19:26,026 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-10-15 00:19:26,030 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-10-15 00:19:26,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:26,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:26,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:26,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:26,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:26,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:26,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:26,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:26,071 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-10-15 00:19:26,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:26,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,074 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-10-15 00:19:26,075 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-10-15 00:19:26,076 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-10-15 00:19:26,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:26,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:26,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:26,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:26,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:26,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:26,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:26,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:26,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:26,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:26,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,124 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-10-15 00:19:26,126 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-10-15 00:19:26,126 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-10-15 00:19:26,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:26,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:26,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:26,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:26,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:26,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:26,147 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:19:26,162 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-15 00:19:26,162 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-15 00:19:26,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:26,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,166 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-10-15 00:19:26,167 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-10-15 00:19:26,167 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:19:26,180 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:19:26,180 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:19:26,181 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 199999 Supporting invariants [] [2024-10-15 00:19:26,197 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-10-15 00:19:26,208 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-15 00:19:26,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:26,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:19:26,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:26,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:19:26,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:26,300 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-10-15 00:19:26,302 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.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-10-15 00:19:26,338 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.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) Result 36 states and 51 transitions. Complement of second has 6 states. [2024-10-15 00:19:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:19:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. 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-10-15 00:19:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-10-15 00:19:26,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-15 00:19:26,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:26,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-15 00:19:26,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:26,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-15 00:19:26,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:26,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 51 transitions. [2024-10-15 00:19:26,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-15 00:19:26,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 16 states and 22 transitions. [2024-10-15 00:19:26,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-15 00:19:26,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:19:26,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2024-10-15 00:19:26,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:26,356 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-10-15 00:19:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2024-10-15 00:19:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-15 00:19:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2024-10-15 00:19:26,377 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-10-15 00:19:26,377 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-10-15 00:19:26,377 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:19:26,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2024-10-15 00:19:26,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-15 00:19:26,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:26,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:26,378 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-15 00:19:26,379 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:19:26,379 INFO L745 eck$LassoCheckResult]: Stem: 122#$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(25, 2); 113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 114#L20-3 assume !(main_~i~0#1 < 100000); 115#L20-4 havoc main_~i~0#1; 109#L25-3 [2024-10-15 00:19:26,379 INFO L747 eck$LassoCheckResult]: Loop: 109#L25-3 call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 110#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109#L25-3 [2024-10-15 00:19:26,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:26,380 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-10-15 00:19:26,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:26,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233759433] [2024-10-15 00:19:26,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:26,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:26,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:26,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233759433] [2024-10-15 00:19:26,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233759433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:19:26,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:19:26,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:19:26,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762711196] [2024-10-15 00:19:26,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:19:26,431 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:26,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:26,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 1 times [2024-10-15 00:19:26,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:26,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779789755] [2024-10-15 00:19:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:26,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:26,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:26,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:26,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:26,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:19:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:19:26,480 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 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-10-15 00:19:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:26,490 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-10-15 00:19:26,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2024-10-15 00:19:26,490 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:26,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 16 transitions. [2024-10-15 00:19:26,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:19:26,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:19:26,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2024-10-15 00:19:26,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:26,491 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-15 00:19:26,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2024-10-15 00:19:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-10-15 00:19:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-10-15 00:19:26,492 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-10-15 00:19:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:19:26,493 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-10-15 00:19:26,493 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:19:26,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2024-10-15 00:19:26,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:26,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:26,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:26,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:19:26,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:19:26,494 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(25, 2); 156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 148#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 149#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 150#L20-3 assume !(main_~i~0#1 < 100000); 151#L20-4 havoc main_~i~0#1; 152#L25-3 [2024-10-15 00:19:26,494 INFO L747 eck$LassoCheckResult]: Loop: 152#L25-3 call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 153#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 152#L25-3 [2024-10-15 00:19:26,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-10-15 00:19:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:26,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972819499] [2024-10-15 00:19:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:26,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:26,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972819499] [2024-10-15 00:19:26,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972819499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:26,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863789485] [2024-10-15 00:19:26,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:26,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:19:26,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,553 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:19:26,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-15 00:19:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:26,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-15 00:19:26,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:26,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:26,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863789485] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:19:26,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:19:26,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-15 00:19:26,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431524724] [2024-10-15 00:19:26,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:26,620 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:26,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 2 times [2024-10-15 00:19:26,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:26,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086178220] [2024-10-15 00:19:26,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:26,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:26,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:26,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:26,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 00:19:26,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-15 00:19:26,662 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:26,689 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-10-15 00:19:26,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2024-10-15 00:19:26,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:26,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2024-10-15 00:19:26,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:19:26,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:19:26,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2024-10-15 00:19:26,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:26,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-15 00:19:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2024-10-15 00:19:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-15 00:19:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-15 00:19:26,692 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-15 00:19:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 00:19:26,693 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-15 00:19:26,693 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:19:26,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2024-10-15 00:19:26,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:26,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:26,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:26,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-10-15 00:19:26,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:19:26,694 INFO L745 eck$LassoCheckResult]: Stem: 227#$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(25, 2); 228#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 220#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 221#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 222#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 223#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 235#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 234#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 233#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 232#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 231#L20-3 assume !(main_~i~0#1 < 100000); 230#L20-4 havoc main_~i~0#1; 224#L25-3 [2024-10-15 00:19:26,694 INFO L747 eck$LassoCheckResult]: Loop: 224#L25-3 call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 225#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 224#L25-3 [2024-10-15 00:19:26,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:26,695 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-10-15 00:19:26,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:26,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242517145] [2024-10-15 00:19:26,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:26,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242517145] [2024-10-15 00:19:26,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242517145] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837879870] [2024-10-15 00:19:26,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:19:26,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:19:26,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,803 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:19:26,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-15 00:19:26,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:19:26,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:19:26,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:19:26,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:26,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:26,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837879870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:19:26,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:19:26,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-15 00:19:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004691015] [2024-10-15 00:19:26,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:26,946 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:26,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 3 times [2024-10-15 00:19:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:26,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453466246] [2024-10-15 00:19:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:26,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:26,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:27,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:27,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 00:19:27,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-15 00:19:27,004 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-10-15 00:19:27,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:27,097 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-10-15 00:19:27,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2024-10-15 00:19:27,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:27,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2024-10-15 00:19:27,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:19:27,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:19:27,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2024-10-15 00:19:27,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:27,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-10-15 00:19:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2024-10-15 00:19:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-15 00:19:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-10-15 00:19:27,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-10-15 00:19:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 00:19:27,102 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-10-15 00:19:27,102 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:19:27,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2024-10-15 00:19:27,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:27,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:27,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:27,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2024-10-15 00:19:27,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:19:27,104 INFO L745 eck$LassoCheckResult]: Stem: 361#$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(25, 2); 362#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 352#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 353#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 354#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 355#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 356#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 379#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 378#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 377#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 376#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 375#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 374#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 373#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 372#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 371#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 370#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 369#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 368#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 367#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 366#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 365#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 364#L20-3 assume !(main_~i~0#1 < 100000); 363#L20-4 havoc main_~i~0#1; 357#L25-3 [2024-10-15 00:19:27,104 INFO L747 eck$LassoCheckResult]: Loop: 357#L25-3 call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 358#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 357#L25-3 [2024-10-15 00:19:27,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2024-10-15 00:19:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:27,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561318990] [2024-10-15 00:19:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:27,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:27,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561318990] [2024-10-15 00:19:27,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561318990] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:27,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036231675] [2024-10-15 00:19:27,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:19:27,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:19:27,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:27,314 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:19:27,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-15 00:19:27,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-15 00:19:27,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:19:27,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:19:27,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:27,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:27,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036231675] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:19:27,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:19:27,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-10-15 00:19:27,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468495636] [2024-10-15 00:19:27,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:27,633 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:27,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:27,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 4 times [2024-10-15 00:19:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:27,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302480509] [2024-10-15 00:19:27,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:27,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:27,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:27,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:27,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:27,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-15 00:19:27,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-10-15 00:19:27,670 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 5 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:27,730 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2024-10-15 00:19:27,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 57 transitions. [2024-10-15 00:19:27,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:27,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 57 transitions. [2024-10-15 00:19:27,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:19:27,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:19:27,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 57 transitions. [2024-10-15 00:19:27,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:27,733 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-10-15 00:19:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 57 transitions. [2024-10-15 00:19:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-15 00:19:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 54 states have internal predecessors, (57), 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-10-15 00:19:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2024-10-15 00:19:27,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-10-15 00:19:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-15 00:19:27,737 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-10-15 00:19:27,737 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:19:27,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2024-10-15 00:19:27,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:27,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:27,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:27,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2024-10-15 00:19:27,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:19:27,739 INFO L745 eck$LassoCheckResult]: Stem: 612#$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(25, 2); 613#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 604#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 605#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 606#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 607#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 608#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 655#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 654#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 653#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 652#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 651#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 650#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 649#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 648#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 647#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 646#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 645#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 644#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 643#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 642#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 641#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 640#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 639#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 638#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 637#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 636#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 635#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 634#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 633#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 632#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 631#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 630#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 629#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 628#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 627#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 626#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 625#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 624#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 623#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 622#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 621#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 620#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 619#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 618#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 617#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 616#L20-3 assume !(main_~i~0#1 < 100000); 615#L20-4 havoc main_~i~0#1; 609#L25-3 [2024-10-15 00:19:27,739 INFO L747 eck$LassoCheckResult]: Loop: 609#L25-3 call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 610#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 609#L25-3 [2024-10-15 00:19:27,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:27,739 INFO L85 PathProgramCache]: Analyzing trace with hash 828161207, now seen corresponding path program 4 times [2024-10-15 00:19:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:27,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270204987] [2024-10-15 00:19:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:28,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:28,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270204987] [2024-10-15 00:19:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270204987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:28,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454764955] [2024-10-15 00:19:28,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:19:28,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:19:28,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:28,569 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:19:28,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-15 00:19:28,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:19:28,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:19:28,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-15 00:19:28,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:28,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454764955] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:19:29,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:19:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-10-15 00:19:29,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494595371] [2024-10-15 00:19:29,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:29,523 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:29,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 5 times [2024-10-15 00:19:29,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:29,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439699119] [2024-10-15 00:19:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:29,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:29,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:29,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-15 00:19:29,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-10-15 00:19:29,554 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. cyclomatic complexity: 5 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:29,669 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2024-10-15 00:19:29,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 105 transitions. [2024-10-15 00:19:29,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:29,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 105 transitions. [2024-10-15 00:19:29,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:19:29,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:19:29,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 105 transitions. [2024-10-15 00:19:29,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:29,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 105 transitions. [2024-10-15 00:19:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 105 transitions. [2024-10-15 00:19:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-15 00:19:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 102 states have internal predecessors, (105), 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-10-15 00:19:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2024-10-15 00:19:29,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 105 transitions. [2024-10-15 00:19:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-15 00:19:29,676 INFO L425 stractBuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2024-10-15 00:19:29,677 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:19:29,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 105 transitions. [2024-10-15 00:19:29,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:29,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:29,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:29,680 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2024-10-15 00:19:29,680 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:19:29,680 INFO L745 eck$LassoCheckResult]: Stem: 1105#$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(25, 2); 1106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 1096#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1097#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1098#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1099#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1100#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1195#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1194#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1193#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1192#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1191#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1190#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1189#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1188#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1187#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1186#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1185#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1184#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1183#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1182#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1181#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1180#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1179#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1178#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1177#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1176#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1175#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1174#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1173#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1172#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1171#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1170#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1169#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1168#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1167#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1166#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1165#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1164#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1163#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1162#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1161#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1160#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1159#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1158#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1157#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1156#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1155#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1154#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1153#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1152#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1151#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1150#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1149#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1148#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1147#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1146#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1145#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1144#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1143#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1142#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1141#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1140#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1139#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1138#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1137#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1136#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1135#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1134#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1133#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1132#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1131#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1130#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1129#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1128#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1127#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1126#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1125#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1124#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1123#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1122#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1121#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1120#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1119#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1118#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1117#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1116#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1115#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1114#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1113#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1112#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1111#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1110#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1109#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1108#L20-3 assume !(main_~i~0#1 < 100000); 1107#L20-4 havoc main_~i~0#1; 1101#L25-3 [2024-10-15 00:19:29,680 INFO L747 eck$LassoCheckResult]: Loop: 1101#L25-3 call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 1102#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1101#L25-3 [2024-10-15 00:19:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash 830581479, now seen corresponding path program 5 times [2024-10-15 00:19:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642858803] [2024-10-15 00:19:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:31,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:31,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642858803] [2024-10-15 00:19:31,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642858803] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:31,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527599524] [2024-10-15 00:19:31,670 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 00:19:31,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:19:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:31,672 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:19:31,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-15 00:19:55,416 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-10-15 00:19:55,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:19:55,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-15 00:19:55,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:55,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:58,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527599524] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:19:58,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:19:58,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-10-15 00:19:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448515058] [2024-10-15 00:19:58,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:58,293 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:58,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:58,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 6 times [2024-10-15 00:19:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:58,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765640822] [2024-10-15 00:19:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:58,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:58,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:58,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:58,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-10-15 00:19:58,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-10-15 00:19:58,360 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. cyclomatic complexity: 5 Second operand has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:58,789 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2024-10-15 00:19:58,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 201 transitions. [2024-10-15 00:19:58,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:58,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 199 states and 201 transitions. [2024-10-15 00:19:58,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:19:58,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:19:58,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 201 transitions. [2024-10-15 00:19:58,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:58,801 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 201 transitions. [2024-10-15 00:19:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 201 transitions. [2024-10-15 00:19:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-10-15 00:19:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 199 states have (on average 1.0100502512562815) internal successors, (201), 198 states have internal predecessors, (201), 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-10-15 00:19:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2024-10-15 00:19:58,820 INFO L240 hiAutomatonCegarLoop]: Abstraction has 199 states and 201 transitions. [2024-10-15 00:19:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-15 00:19:58,821 INFO L425 stractBuchiCegarLoop]: Abstraction has 199 states and 201 transitions. [2024-10-15 00:19:58,826 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:19:58,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 201 transitions. [2024-10-15 00:19:58,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:58,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:58,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:58,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1] [2024-10-15 00:19:58,837 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:19:58,838 INFO L745 eck$LassoCheckResult]: Stem: 2077#$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(25, 2); 2078#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 2068#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2069#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2070#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2071#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2072#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2263#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2262#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2261#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2260#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2259#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2258#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2257#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2256#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2255#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2254#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2253#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2252#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2251#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2250#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2249#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2248#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2247#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2246#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2245#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2244#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2243#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2242#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2241#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2240#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2239#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2238#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2237#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2236#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2235#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2234#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2233#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2232#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2231#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2230#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2229#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2228#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2227#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2226#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2225#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2224#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2223#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2222#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2221#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2220#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2219#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2218#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2217#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2216#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2215#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2214#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2213#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2212#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2211#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2210#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2209#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2208#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2207#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2206#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2205#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2204#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2203#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2202#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2201#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2200#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2199#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2198#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2197#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2196#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2195#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2194#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2193#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2192#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2191#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2190#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2189#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2188#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2187#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2186#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2185#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2184#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2183#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2182#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2181#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2180#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2179#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2178#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2177#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2176#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2175#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2174#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2173#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2172#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2171#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2170#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2169#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2168#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2167#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2166#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2165#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2164#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2163#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2162#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2161#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2160#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2159#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2158#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2157#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2156#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2155#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2154#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2153#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2152#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2151#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2150#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2149#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2148#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2147#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2146#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2145#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2144#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2143#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2142#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2141#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2140#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2139#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2138#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2137#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2136#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2135#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2134#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2133#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2132#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2131#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2130#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2129#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2128#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2127#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2126#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2125#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2124#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2123#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2122#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2121#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2120#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2119#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2118#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2117#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2116#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2115#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2114#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2113#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2112#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2111#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2110#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2109#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2108#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2107#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2106#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2105#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2104#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2103#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2102#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2101#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2100#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2099#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2098#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2097#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2096#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2095#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2094#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2093#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2092#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2091#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2090#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2089#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2088#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2087#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2086#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2085#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2084#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2083#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2082#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2081#L20-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2080#L20-3 assume !(main_~i~0#1 < 100000); 2079#L20-4 havoc main_~i~0#1; 2073#L25-3 [2024-10-15 00:19:58,839 INFO L747 eck$LassoCheckResult]: Loop: 2073#L25-3 call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 2074#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2073#L25-3 [2024-10-15 00:19:58,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1165371207, now seen corresponding path program 6 times [2024-10-15 00:19:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:58,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103996330] [2024-10-15 00:19:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:58,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:20:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:20:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:20:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103996330] [2024-10-15 00:20:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103996330] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:20:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029214111] [2024-10-15 00:20:04,028 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-15 00:20:04,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:20:04,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:20:04,029 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:20:04,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process