./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/standard_sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/array-examples/standard_sentinel-2.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 590a845a219659d0ad58521e10c3551f2ec7e80ca70e994a8616abe765f6f296 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:14:28,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:14:28,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:14:28,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:14:28,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:14:29,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:14:29,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:14:29,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:14:29,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:14:29,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:14:29,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:14:29,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:14:29,030 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:14:29,030 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:14:29,031 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:14:29,031 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:14:29,035 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:14:29,036 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:14:29,036 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:14:29,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:14:29,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:14:29,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:14:29,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:14:29,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:14:29,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:14:29,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:14:29,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:14:29,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:14:29,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:14:29,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:14:29,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:14:29,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:14:29,039 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:14:29,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:14:29,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:14:29,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:14:29,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:14:29,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:14:29,043 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:14:29,043 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 -> 590a845a219659d0ad58521e10c3551f2ec7e80ca70e994a8616abe765f6f296 [2024-11-23 02:14:29,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:14:29,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:14:29,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:14:29,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:14:29,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:14:29,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_sentinel-2.i [2024-11-23 02:14:30,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:14:30,776 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:14:30,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_sentinel-2.i [2024-11-23 02:14:30,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97847e017/f793cadd9fcc4a2eacfa35e0638ba6d6/FLAG61679e463 [2024-11-23 02:14:30,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97847e017/f793cadd9fcc4a2eacfa35e0638ba6d6 [2024-11-23 02:14:30,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:14:30,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:14:30,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:14:30,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:14:30,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:14:30,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e06195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30, skipping insertion in model container [2024-11-23 02:14:30,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:14:30,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:14:30,995 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:14:31,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:14:31,023 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:14:31,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31 WrapperNode [2024-11-23 02:14:31,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:14:31,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:14:31,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:14:31,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:14:31,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,052 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2024-11-23 02:14:31,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:14:31,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:14:31,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:14:31,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:14:31,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,074 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 2 writes are split as follows [0, 2]. [2024-11-23 02:14:31,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:14:31,091 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:14:31,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:14:31,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:14:31,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (1/1) ... [2024-11-23 02:14:31,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:31,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:31,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:31,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-23 02:14:31,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 02:14:31,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 02:14:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 02:14:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 02:14:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:14:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 02:14:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:14:31,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:14:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 02:14:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 02:14:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 02:14:31,238 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:14:31,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:14:31,365 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-23 02:14:31,365 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:14:31,383 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:14:31,385 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 02:14:31,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:31 BoogieIcfgContainer [2024-11-23 02:14:31,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:14:31,386 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:14:31,386 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:14:31,394 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:14:31,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:14:31,395 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:14:30" (1/3) ... [2024-11-23 02:14:31,399 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c6c3e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:14:31, skipping insertion in model container [2024-11-23 02:14:31,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:14:31,399 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:31" (2/3) ... [2024-11-23 02:14:31,399 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c6c3e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:14:31, skipping insertion in model container [2024-11-23 02:14:31,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:14:31,399 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:31" (3/3) ... [2024-11-23 02:14:31,400 INFO L332 chiAutomizerObserver]: Analyzing ICFG standard_sentinel-2.i [2024-11-23 02:14:31,462 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:14:31,462 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:14:31,463 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:14:31,463 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:14:31,463 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:14:31,463 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:14:31,463 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:14:31,463 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:14:31,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:31,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:14:31,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:31,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:31,483 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:14:31,483 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:31,483 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:14:31,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:31,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:14:31,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:31,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:31,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:14:31,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:31,491 INFO L745 eck$LassoCheckResult]: Stem: 14#$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(22, 2); 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_#t~nondet1#1;main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 11#L20-3true [2024-11-23 02:14:31,491 INFO L747 eck$LassoCheckResult]: Loop: 11#L20-3true assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12#L20-2true main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 11#L20-3true [2024-11-23 02:14:31,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-23 02:14:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059773530] [2024-11-23 02:14:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:31,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-23 02:14:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:31,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788602109] [2024-11-23 02:14:31,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:31,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-23 02:14:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:31,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666730276] [2024-11-23 02:14:31,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:31,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:32,044 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:14:32,046 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:14:32,046 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:14:32,047 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:14:32,047 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:14:32,047 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,047 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:14:32,048 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:14:32,048 INFO L132 ssoRankerPreferences]: Filename of dumped script: standard_sentinel-2.i_Iteration1_Lasso [2024-11-23 02:14:32,048 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:14:32,049 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:14:32,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,463 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:14:32,466 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:14:32,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-23 02:14:32,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:14:32,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:14:32,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:14:32,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,513 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-11-23 02:14:32,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,516 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-23 02:14:32,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:14:32,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:14:32,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:14:32,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-23 02:14:32,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:14:32,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-23 02:14:32,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:14:32,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:14:32,590 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:14:32,612 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-23 02:14:32,613 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-23 02:14:32,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-23 02:14:32,646 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:14:32,659 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:14:32,659 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:14:32,660 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-23 02:14:32,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-23 02:14:32,693 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-23 02:14:32,718 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:14:32,723 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:14:32,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-23 02:14:32,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:32,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:14:32,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:32,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:14:32,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:32,868 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:14:32,870 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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-11-23 02:14:32,931 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 34 states and 47 transitions. Complement of second has 6 states. [2024-11-23 02:14:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:14:32,936 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-11-23 02:14:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-23 02:14:32,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-23 02:14:32,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:14:32,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-23 02:14:32,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:14:32,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-23 02:14:32,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:14:32,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2024-11-23 02:14:32,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:32,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 9 states and 11 transitions. [2024-11-23 02:14:32,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-23 02:14:32,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-23 02:14:32,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2024-11-23 02:14:32,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:32,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-23 02:14:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2024-11-23 02:14:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-23 02:14:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-23 02:14:32,962 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-23 02:14:32,962 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-23 02:14:32,962 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:14:32,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-11-23 02:14:32,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:32,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:32,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:32,963 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-23 02:14:32,963 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:32,964 INFO L745 eck$LassoCheckResult]: Stem: 111#$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(22, 2); 112#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_#t~nondet1#1;main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 104#L20-3 assume !(main_~i~0#1 < 100000); 105#L20-4 havoc main_~i~0#1; 110#L25 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int#1(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 109#L28-3 [2024-11-23 02:14:32,964 INFO L747 eck$LassoCheckResult]: Loop: 109#L28-3 call main_#t~mem5#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 108#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 109#L28-3 [2024-11-23 02:14:32,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:32,964 INFO L85 PathProgramCache]: Analyzing trace with hash 28696936, now seen corresponding path program 1 times [2024-11-23 02:14:32,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:32,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903117473] [2024-11-23 02:14:32,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:32,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:33,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:33,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903117473] [2024-11-23 02:14:33,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903117473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:14:33,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:14:33,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:14:33,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201880992] [2024-11-23 02:14:33,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:14:33,016 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:33,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1734, now seen corresponding path program 1 times [2024-11-23 02:14:33,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113454583] [2024-11-23 02:14:33,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:33,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:33,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:33,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:33,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:33,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:14:33,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:14:33,092 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:33,101 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2024-11-23 02:14:33,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2024-11-23 02:14:33,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:33,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2024-11-23 02:14:33,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-23 02:14:33,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-23 02:14:33,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2024-11-23 02:14:33,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:33,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-23 02:14:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2024-11-23 02:14:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-23 02:14:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-23 02:14:33,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-23 02:14:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:14:33,104 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-23 02:14:33,104 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:14:33,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2024-11-23 02:14:33,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:33,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:33,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:33,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:14:33,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:33,106 INFO L745 eck$LassoCheckResult]: Stem: 136#$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(22, 2); 137#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_#t~nondet1#1;main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 131#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 132#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 133#L20-3 assume !(main_~i~0#1 < 100000); 134#L20-4 havoc main_~i~0#1; 135#L25 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int#1(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 130#L28-3 [2024-11-23 02:14:33,106 INFO L747 eck$LassoCheckResult]: Loop: 130#L28-3 call main_#t~mem5#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 129#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 130#L28-3 [2024-11-23 02:14:33,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669542, now seen corresponding path program 1 times [2024-11-23 02:14:33,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149545528] [2024-11-23 02:14:33,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:33,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:33,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:33,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149545528] [2024-11-23 02:14:33,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149545528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:14:33,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441244300] [2024-11-23 02:14:33,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:33,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:14:33,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:33,153 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:14:33,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 02:14:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:33,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 02:14:33,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:33,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:14:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:33,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441244300] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:14:33,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:14:33,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-23 02:14:33,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222021621] [2024-11-23 02:14:33,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:14:33,226 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:33,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1734, now seen corresponding path program 2 times [2024-11-23 02:14:33,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180485343] [2024-11-23 02:14:33,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:14:33,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,231 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:14:33,231 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:14:33,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:33,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:33,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:33,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 02:14:33,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-23 02:14:33,261 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:33,278 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2024-11-23 02:14:33,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2024-11-23 02:14:33,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:33,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2024-11-23 02:14:33,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-23 02:14:33,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-23 02:14:33,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2024-11-23 02:14:33,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:33,280 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-23 02:14:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2024-11-23 02:14:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-23 02:14:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-23 02:14:33,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-23 02:14:33,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:14:33,282 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-23 02:14:33,282 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:14:33,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2024-11-23 02:14:33,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:33,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:33,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:33,283 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2024-11-23 02:14:33,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:33,283 INFO L745 eck$LassoCheckResult]: Stem: 207#$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(22, 2); 208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_#t~nondet1#1;main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 199#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 200#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 201#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 202#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 203#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 213#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 212#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 211#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 210#L20-3 assume !(main_~i~0#1 < 100000); 209#L20-4 havoc main_~i~0#1; 206#L25 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int#1(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 205#L28-3 [2024-11-23 02:14:33,283 INFO L747 eck$LassoCheckResult]: Loop: 205#L28-3 call main_#t~mem5#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 204#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 205#L28-3 [2024-11-23 02:14:33,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash 82232672, now seen corresponding path program 2 times [2024-11-23 02:14:33,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236660383] [2024-11-23 02:14:33,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:14:33,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,295 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:14:33,296 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:33,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:33,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236660383] [2024-11-23 02:14:33,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236660383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:14:33,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159906268] [2024-11-23 02:14:33,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:14:33,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:14:33,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:33,368 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:14:33,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 02:14:33,409 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:14:33,409 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:33,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:14:33,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:33,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:14:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:33,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159906268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:14:33,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:14:33,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-23 02:14:33,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630519590] [2024-11-23 02:14:33,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:14:33,486 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:33,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1734, now seen corresponding path program 3 times [2024-11-23 02:14:33,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355923810] [2024-11-23 02:14:33,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:14:33,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,490 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:14:33,490 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:14:33,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:33,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:33,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:33,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 02:14:33,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-23 02:14:33,523 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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-11-23 02:14:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:33,554 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-23 02:14:33,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2024-11-23 02:14:33,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:33,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2024-11-23 02:14:33,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-23 02:14:33,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-23 02:14:33,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2024-11-23 02:14:33,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:33,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-23 02:14:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2024-11-23 02:14:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-23 02:14:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-23 02:14:33,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-23 02:14:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 02:14:33,559 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-23 02:14:33,559 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:14:33,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2024-11-23 02:14:33,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:33,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:33,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:33,560 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2024-11-23 02:14:33,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:33,560 INFO L745 eck$LassoCheckResult]: Stem: 337#$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(22, 2); 338#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_#t~nondet1#1;main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 329#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 330#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 331#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 332#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 333#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 355#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 354#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 353#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 352#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 351#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 350#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 349#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 348#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 347#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 346#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 345#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 344#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 343#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 342#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 341#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 340#L20-3 assume !(main_~i~0#1 < 100000); 339#L20-4 havoc main_~i~0#1; 336#L25 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int#1(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 335#L28-3 [2024-11-23 02:14:33,560 INFO L747 eck$LassoCheckResult]: Loop: 335#L28-3 call main_#t~mem5#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 334#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 335#L28-3 [2024-11-23 02:14:33,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1520933460, now seen corresponding path program 3 times [2024-11-23 02:14:33,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176859359] [2024-11-23 02:14:33,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:14:33,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,587 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-23 02:14:33,588 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:33,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:33,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176859359] [2024-11-23 02:14:33,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176859359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:14:33,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187232090] [2024-11-23 02:14:33,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:14:33,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:14:33,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:33,796 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:14:33,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 02:14:33,875 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-23 02:14:33,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:33,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-23 02:14:33,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:33,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:14:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:34,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187232090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:14:34,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:14:34,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-23 02:14:34,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006626775] [2024-11-23 02:14:34,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:14:34,157 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:34,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1734, now seen corresponding path program 4 times [2024-11-23 02:14:34,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:34,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074856560] [2024-11-23 02:14:34,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:14:34,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:34,161 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:14:34,161 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:14:34,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:34,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:34,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:34,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-23 02:14:34,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-23 02:14:34,197 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:34,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:34,262 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2024-11-23 02:14:34,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 52 transitions. [2024-11-23 02:14:34,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:34,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 52 transitions. [2024-11-23 02:14:34,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-23 02:14:34,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-23 02:14:34,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 52 transitions. [2024-11-23 02:14:34,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:34,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-23 02:14:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 52 transitions. [2024-11-23 02:14:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-23 02:14:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-11-23 02:14:34,267 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-23 02:14:34,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-23 02:14:34,269 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-23 02:14:34,270 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:14:34,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 52 transitions. [2024-11-23 02:14:34,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:34,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:34,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:34,271 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1] [2024-11-23 02:14:34,271 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:34,272 INFO L745 eck$LassoCheckResult]: Stem: 587#$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(22, 2); 588#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_#t~nondet1#1;main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 579#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 580#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 581#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 582#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 583#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 629#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 628#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 627#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 626#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 625#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 624#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 623#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 622#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 621#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 620#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 619#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 618#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 617#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 616#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 615#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 614#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 613#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 612#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 611#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 610#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 609#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 608#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 607#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 606#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 605#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 604#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 603#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 602#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 601#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 600#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 599#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 598#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 597#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 596#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 595#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 594#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 593#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 592#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 591#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 590#L20-3 assume !(main_~i~0#1 < 100000); 589#L20-4 havoc main_~i~0#1; 586#L25 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int#1(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 585#L28-3 [2024-11-23 02:14:34,272 INFO L747 eck$LassoCheckResult]: Loop: 585#L28-3 call main_#t~mem5#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 584#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 585#L28-3 [2024-11-23 02:14:34,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:34,272 INFO L85 PathProgramCache]: Analyzing trace with hash -96806340, now seen corresponding path program 4 times [2024-11-23 02:14:34,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:34,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624341844] [2024-11-23 02:14:34,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:14:34,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:34,304 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:14:34,304 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:34,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:34,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624341844] [2024-11-23 02:14:34,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624341844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:14:34,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449391993] [2024-11-23 02:14:34,825 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:14:34,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:14:34,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:34,829 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:14:34,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 02:14:34,917 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:14:34,917 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:34,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-23 02:14:34,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:35,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:14:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449391993] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:14:35,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:14:35,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-11-23 02:14:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60507133] [2024-11-23 02:14:35,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:14:35,941 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:35,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:35,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1734, now seen corresponding path program 5 times [2024-11-23 02:14:35,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:35,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230539198] [2024-11-23 02:14:35,941 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:14:35,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:35,945 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:14:35,946 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:14:35,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:35,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:35,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-23 02:14:35,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-23 02:14:35,995 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 48 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:36,171 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2024-11-23 02:14:36,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 100 transitions. [2024-11-23 02:14:36,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:36,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 100 transitions. [2024-11-23 02:14:36,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-23 02:14:36,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-23 02:14:36,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 100 transitions. [2024-11-23 02:14:36,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:36,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 100 transitions. [2024-11-23 02:14:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 100 transitions. [2024-11-23 02:14:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-23 02:14:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 98 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2024-11-23 02:14:36,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 100 transitions. [2024-11-23 02:14:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-23 02:14:36,194 INFO L425 stractBuchiCegarLoop]: Abstraction has 99 states and 100 transitions. [2024-11-23 02:14:36,194 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:14:36,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 100 transitions. [2024-11-23 02:14:36,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:14:36,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:36,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:36,197 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1] [2024-11-23 02:14:36,197 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:36,203 INFO L745 eck$LassoCheckResult]: Stem: 1076#$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(22, 2); 1077#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_#t~nondet1#1;main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 1070#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1071#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1072#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1068#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1069#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1166#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1165#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1164#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1163#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1162#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1161#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1160#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1159#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1158#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1157#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1156#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1155#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1154#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1153#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1152#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1151#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1150#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1149#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1148#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1147#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1146#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1145#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1144#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1143#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1142#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1141#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1140#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1139#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1138#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1137#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1136#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1135#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1134#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1133#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1132#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1131#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1130#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1129#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1128#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1127#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1126#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1125#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1124#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1123#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1122#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1121#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1120#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1119#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1118#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1117#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1116#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1115#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1114#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1113#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1112#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1111#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1110#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1109#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1108#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1107#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1106#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1105#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1104#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1103#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1102#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1101#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1100#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1099#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1098#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1097#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1096#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1095#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1094#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1093#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1092#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1091#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1090#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1089#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1088#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1087#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1086#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1085#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1084#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1083#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1082#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1081#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1080#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1079#L20-3 assume !(main_~i~0#1 < 100000); 1078#L20-4 havoc main_~i~0#1; 1075#L25 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int#1(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 1074#L28-3 [2024-11-23 02:14:36,203 INFO L747 eck$LassoCheckResult]: Loop: 1074#L28-3 call main_#t~mem5#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 1073#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 1074#L28-3 [2024-11-23 02:14:36,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash -21777908, now seen corresponding path program 5 times [2024-11-23 02:14:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:36,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619790837] [2024-11-23 02:14:36,204 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:14:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:36,454 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-23 02:14:36,454 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:38,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:38,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619790837] [2024-11-23 02:14:38,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619790837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:14:38,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011681512] [2024-11-23 02:14:38,332 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:14:38,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:14:38,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:38,335 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:14:38,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 02:16:12,389 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-23 02:16:12,389 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:16:12,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-23 02:16:12,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:12,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:16:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:14,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011681512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:16:14,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:16:14,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2024-11-23 02:16:14,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341043080] [2024-11-23 02:16:14,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:16:14,924 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:16:14,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:14,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1734, now seen corresponding path program 6 times [2024-11-23 02:16:14,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:14,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917106909] [2024-11-23 02:16:14,925 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:16:14,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:14,930 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 02:16:14,930 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:14,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:14,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:14,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:16:14,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-23 02:16:14,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-23 02:16:14,974 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. cyclomatic complexity: 3 Second operand has 96 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 96 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:16:15,341 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2024-11-23 02:16:15,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 196 transitions. [2024-11-23 02:16:15,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:16:15,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 196 transitions. [2024-11-23 02:16:15,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-23 02:16:15,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-23 02:16:15,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 196 transitions. [2024-11-23 02:16:15,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:16:15,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 196 transitions. [2024-11-23 02:16:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 196 transitions. [2024-11-23 02:16:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-23 02:16:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 1.005128205128205) internal successors, (196), 194 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2024-11-23 02:16:15,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 195 states and 196 transitions. [2024-11-23 02:16:15,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-23 02:16:15,354 INFO L425 stractBuchiCegarLoop]: Abstraction has 195 states and 196 transitions. [2024-11-23 02:16:15,354 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:16:15,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 196 transitions. [2024-11-23 02:16:15,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-23 02:16:15,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:15,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:15,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1, 1] [2024-11-23 02:16:15,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:16:15,364 INFO L745 eck$LassoCheckResult]: Stem: 2045#$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(22, 2); 2046#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_#t~nondet1#1;main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 2037#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2038#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2039#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2040#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2041#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2231#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2230#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2229#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2228#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2227#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2226#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2225#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2224#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2223#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2222#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2221#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2220#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2219#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2218#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2217#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2216#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2215#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2214#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2213#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2212#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2211#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2210#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2209#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2208#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2207#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2206#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2205#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2204#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2203#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2202#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2201#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2200#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2199#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2198#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2197#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2196#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2195#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2194#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2193#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2192#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2191#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2190#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2189#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2188#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2187#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2186#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2185#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2184#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2183#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2182#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2181#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2180#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2179#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2178#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2177#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2176#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2175#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2174#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2173#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2172#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2171#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2170#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2169#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2168#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2167#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2166#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2165#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2164#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2163#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2162#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2161#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2160#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2159#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2158#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2157#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2156#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2155#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2154#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2153#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2152#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2151#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2150#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2149#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2148#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2147#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2146#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2145#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2144#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2143#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2142#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2141#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2140#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2139#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2138#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2137#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2136#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2135#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2134#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2133#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2132#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2131#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2130#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2129#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2128#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2127#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2126#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2125#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2124#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2123#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2122#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2121#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2120#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2119#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2118#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2117#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2116#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2115#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2114#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2113#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2112#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2111#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2110#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2109#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2108#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2107#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2106#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2105#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2104#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2103#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2102#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2101#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2100#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2099#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2098#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2097#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2096#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2095#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2094#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2093#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2092#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2091#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2090#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2089#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2088#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2087#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2086#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2085#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2084#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2083#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2082#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2081#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2080#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2079#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2078#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2077#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2076#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2075#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2074#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2073#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2072#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2071#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2070#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2069#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2068#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2067#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2066#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2065#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2064#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2063#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2062#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2061#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2060#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2059#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2058#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2057#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2056#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2055#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2054#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2053#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2052#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2051#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2050#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2049#L20-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2048#L20-3 assume !(main_~i~0#1 < 100000); 2047#L20-4 havoc main_~i~0#1; 2044#L25 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int#1(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 2043#L28-3 [2024-11-23 02:16:15,365 INFO L747 eck$LassoCheckResult]: Loop: 2043#L28-3 call main_#t~mem5#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 2042#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 2043#L28-3 [2024-11-23 02:16:15,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:15,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1766769068, now seen corresponding path program 6 times [2024-11-23 02:16:15,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:15,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787996718] [2024-11-23 02:16:15,365 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:16:15,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:15,628 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-11-23 02:16:15,628 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat