./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-acceleration/array_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-acceleration/array_2-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 866342b97e5be917007cb97e07a0644c7c9d2aa9b428c32cf026d727d672a191 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:49:54,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:49:54,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:49:54,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:49:54,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:49:54,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:49:54,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:49:54,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:49:54,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:49:54,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:49:54,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:49:54,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:49:54,944 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:49:54,944 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:49:54,946 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:49:54,946 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:49:54,946 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:49:54,947 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:49:54,947 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:49:54,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:49:54,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:49:54,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:49:54,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:49:54,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:49:54,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:49:54,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:49:54,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:49:54,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:49:54,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:49:54,953 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:49:54,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:49:54,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:49:54,954 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:49:54,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:49:54,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:49:54,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:49:54,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:49:54,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:49:54,955 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:49:54,956 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 -> 866342b97e5be917007cb97e07a0644c7c9d2aa9b428c32cf026d727d672a191 [2024-11-09 15:49:55,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:49:55,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:49:55,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:49:55,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:49:55,249 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:49:55,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/array_2-2.i [2024-11-09 15:49:56,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:49:56,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:49:56,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/array_2-2.i [2024-11-09 15:49:56,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c423762/e5ea10913d7447bd806a728d56e07094/FLAGb7ae00c45 [2024-11-09 15:49:56,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c423762/e5ea10913d7447bd806a728d56e07094 [2024-11-09 15:49:56,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:49:56,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:49:56,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:49:56,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:49:56,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:49:56,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:49:56" (1/1) ... [2024-11-09 15:49:56,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abab8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:56, skipping insertion in model container [2024-11-09 15:49:56,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:49:56" (1/1) ... [2024-11-09 15:49:56,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:49:57,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:49:57,073 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:49:57,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:49:57,103 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:49:57,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57 WrapperNode [2024-11-09 15:49:57,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:49:57,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:49:57,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:49:57,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:49:57,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,133 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2024-11-09 15:49:57,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:49:57,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:49:57,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:49:57,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:49:57,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,165 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 3, 3]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-09 15:49:57,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:49:57,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:49:57,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:49:57,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:49:57,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (1/1) ... [2024-11-09 15:49:57,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:57,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:57,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:49:57,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:49:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:49:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:49:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 15:49:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 15:49:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:49:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:49:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:49:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 15:49:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:49:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:49:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:49:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:49:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 15:49:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:49:57,324 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:49:57,327 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:49:57,495 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 15:49:57,496 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:49:57,509 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:49:57,510 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:49:57,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:49:57 BoogieIcfgContainer [2024-11-09 15:49:57,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:49:57,512 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:49:57,512 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:49:57,517 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:49:57,518 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:49:57,518 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:49:56" (1/3) ... [2024-11-09 15:49:57,519 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@284b3a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:49:57, skipping insertion in model container [2024-11-09 15:49:57,519 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:49:57,519 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:57" (2/3) ... [2024-11-09 15:49:57,520 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@284b3a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:49:57, skipping insertion in model container [2024-11-09 15:49:57,521 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:49:57,521 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:49:57" (3/3) ... [2024-11-09 15:49:57,522 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_2-2.i [2024-11-09 15:49:57,583 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:49:57,583 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:49:57,583 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:49:57,583 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:49:57,583 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:49:57,584 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:49:57,584 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:49:57,584 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:49:57,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:49:57,607 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:49:57,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:57,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:57,612 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:49:57,613 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:49:57,613 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:49:57,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:49:57,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:49:57,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:57,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:57,615 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:49:57,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:49:57,649 INFO L745 eck$LassoCheckResult]: Stem: 13#$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(12, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 6#L25-3true [2024-11-09 15:49:57,649 INFO L747 eck$LassoCheckResult]: Loop: 6#L25-3true assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 10#L25-2true main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 6#L25-3true [2024-11-09 15:49:57,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:49:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:57,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962245603] [2024-11-09 15:49:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:57,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:57,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:57,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-09 15:49:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:57,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602411846] [2024-11-09 15:49:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:57,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:57,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:57,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:57,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:57,851 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-09 15:49:57,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:57,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118432125] [2024-11-09 15:49:57,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:57,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:57,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:57,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:58,361 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:49:58,362 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:49:58,362 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:49:58,362 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:49:58,362 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:49:58,362 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:58,362 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:49:58,362 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:49:58,362 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_2-2.i_Iteration1_Lasso [2024-11-09 15:49:58,363 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:49:58,363 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:49:58,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:58,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:58,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:58,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:58,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:58,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:58,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:58,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:58,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:58,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:58,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:58,904 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:49:58,908 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:49:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:58,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:58,912 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-09 15:49:58,913 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-09 15:49:58,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:49:58,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:58,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:58,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:58,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:58,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:58,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:58,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:58,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:58,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:58,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:58,958 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-09 15:49:58,959 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-09 15:49:58,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:49:58,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:58,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:58,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:58,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:58,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:58,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:58,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:58,995 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-09 15:49:58,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:58,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:58,998 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-09 15:49:59,000 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-09 15:49:59,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:49:59,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:59,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:59,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:59,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:59,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:59,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:59,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:59,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:59,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:59,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:59,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:59,033 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-09 15:49:59,034 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-09 15:49:59,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:49:59,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:59,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:59,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:59,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:59,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:59,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:59,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:59,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:59,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:59,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:59,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:59,069 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:49:59,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:49:59,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:49:59,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:59,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:59,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:59,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:59,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:59,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:59,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:59,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:49:59,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:59,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:59,119 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:49:59,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:49:59,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:49:59,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:59,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:59,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:59,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:59,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:59,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:59,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:59,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:49:59,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:59,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:59,158 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:49:59,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:49:59,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:49:59,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:59,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:59,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:59,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:59,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:59,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:59,195 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:49:59,219 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:49:59,220 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:49:59,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:59,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:59,224 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:49:59,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:49:59,227 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:49:59,241 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:49:59,242 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:49:59,242 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 4095 Supporting invariants [] [2024-11-09 15:49:59,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-09 15:49:59,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:49:59,309 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-09 15:49:59,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:59,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:49:59,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:59,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:49:59,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:49:59,418 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:49:59,420 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-09 15:49:59,465 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 30 states and 41 transitions. Complement of second has 6 states. [2024-11-09 15:49:59,469 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-09 15:49:59,474 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-09 15:49:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-11-09 15:49:59,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-09 15:49:59,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:59,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-09 15:49:59,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:59,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-09 15:49:59,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:59,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2024-11-09 15:49:59,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:49:59,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 8 states and 10 transitions. [2024-11-09 15:49:59,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:49:59,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-09 15:49:59,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2024-11-09 15:49:59,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:49:59,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-11-09 15:49:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2024-11-09 15:49:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-09 15:49:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 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-09 15:49:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2024-11-09 15:49:59,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-11-09 15:49:59,514 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-11-09 15:49:59,514 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:49:59,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2024-11-09 15:49:59,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:49:59,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:59,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:59,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:49:59,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:49:59,517 INFO L745 eck$LassoCheckResult]: Stem: 120#$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(12, 2); 121#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~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 118#L25-3 assume !(main_~i~0#1 < 2048); 119#L25-4 main_~i~0#1 := 0; 116#L29-3 [2024-11-09 15:49:59,517 INFO L747 eck$LassoCheckResult]: Loop: 116#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 117#L29-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 116#L29-3 [2024-11-09 15:49:59,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:59,517 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-11-09 15:49:59,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:59,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738787380] [2024-11-09 15:49:59,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:59,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:49:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:49:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738787380] [2024-11-09 15:49:59,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738787380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:49:59,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:49:59,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:49:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016609146] [2024-11-09 15:49:59,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:49:59,615 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:49:59,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2024-11-09 15:49:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:59,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326626291] [2024-11-09 15:49:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:59,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:59,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:59,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:49:59,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:49:59,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:49:59,735 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 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-09 15:49:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:49:59,754 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2024-11-09 15:49:59,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2024-11-09 15:49:59,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:49:59,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2024-11-09 15:49:59,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-09 15:49:59,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-09 15:49:59,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2024-11-09 15:49:59,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:49:59,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-09 15:49:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2024-11-09 15:49:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2024-11-09 15:49:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:49:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2024-11-09 15:49:59,760 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-09 15:49:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:49:59,762 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-09 15:49:59,763 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:49:59,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2024-11-09 15:49:59,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:49:59,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:59,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:59,764 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:49:59,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:49:59,764 INFO L745 eck$LassoCheckResult]: Stem: 145#$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(12, 2); 146#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~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 143#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 139#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 140#L25-3 assume !(main_~i~0#1 < 2048); 144#L25-4 main_~i~0#1 := 0; 141#L29-3 [2024-11-09 15:49:59,765 INFO L747 eck$LassoCheckResult]: Loop: 141#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 142#L29-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 141#L29-3 [2024-11-09 15:49:59,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:59,766 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-11-09 15:49:59,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:59,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605532089] [2024-11-09 15:49:59,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:59,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:59,827 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-09 15:49:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:49:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605532089] [2024-11-09 15:49:59,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605532089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:49:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508812233] [2024-11-09 15:49:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:59,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:49:59,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:59,831 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-09 15:49:59,832 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-09 15:49:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:59,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 15:49:59,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:59,908 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-09 15:49:59,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:49:59,933 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-09 15:49:59,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508812233] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:49:59,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:49:59,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 15:49:59,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734853568] [2024-11-09 15:49:59,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:49:59,934 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:49:59,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:59,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2024-11-09 15:49:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:59,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174618466] [2024-11-09 15:49:59,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:59,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:59,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:59,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:50:00,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:50:00,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:50:00,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:50:00,030 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:50:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:50:00,081 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-09 15:50:00,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2024-11-09 15:50:00,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:50:00,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2024-11-09 15:50:00,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-09 15:50:00,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-09 15:50:00,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2024-11-09 15:50:00,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:50:00,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-09 15:50:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2024-11-09 15:50:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2024-11-09 15:50:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:50:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-09 15:50:00,087 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-09 15:50:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:50:00,089 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-09 15:50:00,090 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:50:00,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2024-11-09 15:50:00,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:50:00,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:50:00,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:50:00,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-11-09 15:50:00,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:50:00,091 INFO L745 eck$LassoCheckResult]: Stem: 216#$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(12, 2); 217#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~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 212#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 213#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 214#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 208#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 209#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 221#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 220#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 219#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 218#L25-3 assume !(main_~i~0#1 < 2048); 215#L25-4 main_~i~0#1 := 0; 210#L29-3 [2024-11-09 15:50:00,091 INFO L747 eck$LassoCheckResult]: Loop: 210#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 211#L29-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 210#L29-3 [2024-11-09 15:50:00,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:50:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-11-09 15:50:00,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:50:00,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842765846] [2024-11-09 15:50:00,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:50:00,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:50:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:50:00,267 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-09 15:50:00,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:50:00,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842765846] [2024-11-09 15:50:00,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842765846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:50:00,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125651498] [2024-11-09 15:50:00,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:50:00,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:50:00,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:50:00,271 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:50:00,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 15:50:00,340 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:50:00,340 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:50:00,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:50:00,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:50:00,372 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-09 15:50:00,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:50:00,441 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-09 15:50:00,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125651498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:50:00,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:50:00,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 15:50:00,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456291933] [2024-11-09 15:50:00,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:50:00,442 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:50:00,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:50:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2024-11-09 15:50:00,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:50:00,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123047041] [2024-11-09 15:50:00,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:50:00,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:50:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:50:00,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:50:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:50:00,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:50:00,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:50:00,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:50:00,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 15:50:00,545 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:50:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:50:00,646 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-11-09 15:50:00,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions. [2024-11-09 15:50:00,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:50:00,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions. [2024-11-09 15:50:00,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-09 15:50:00,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-09 15:50:00,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2024-11-09 15:50:00,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:50:00,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-11-09 15:50:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2024-11-09 15:50:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2024-11-09 15:50:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:50:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-11-09 15:50:00,656 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-09 15:50:00,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 15:50:00,657 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-09 15:50:00,657 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:50:00,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2024-11-09 15:50:00,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:50:00,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:50:00,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:50:00,660 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2024-11-09 15:50:00,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:50:00,661 INFO L745 eck$LassoCheckResult]: Stem: 357#$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(12, 2); 358#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~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 353#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 354#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 355#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 349#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 350#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 374#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 373#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 372#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 371#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 370#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 369#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 368#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 367#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 366#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 365#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 364#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 363#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 362#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 361#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 360#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 359#L25-3 assume !(main_~i~0#1 < 2048); 356#L25-4 main_~i~0#1 := 0; 351#L29-3 [2024-11-09 15:50:00,661 INFO L747 eck$LassoCheckResult]: Loop: 351#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 352#L29-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 351#L29-3 [2024-11-09 15:50:00,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:50:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2024-11-09 15:50:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:50:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905532705] [2024-11-09 15:50:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:50:00,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:50:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:50:01,017 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-09 15:50:01,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:50:01,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905532705] [2024-11-09 15:50:01,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905532705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:50:01,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024689373] [2024-11-09 15:50:01,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:50:01,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:50:01,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:50:01,022 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:50:01,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 15:50:01,498 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-09 15:50:01,498 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:50:01,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:50:01,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:50:01,572 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-09 15:50:01,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:50:01,809 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-09 15:50:01,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024689373] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:50:01,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:50:01,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-09 15:50:01,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11573232] [2024-11-09 15:50:01,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:50:01,810 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:50:01,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:50:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2024-11-09 15:50:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:50:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855988976] [2024-11-09 15:50:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:50:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:50:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:50:01,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:50:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:50:01,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:50:01,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:50:01,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 15:50:01,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-09 15:50:01,893 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:50:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:50:02,099 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2024-11-09 15:50:02,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 94 transitions. [2024-11-09 15:50:02,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:50:02,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 93 states and 94 transitions. [2024-11-09 15:50:02,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-09 15:50:02,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-09 15:50:02,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 94 transitions. [2024-11-09 15:50:02,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:50:02,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 94 transitions. [2024-11-09 15:50:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 94 transitions. [2024-11-09 15:50:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 50. [2024-11-09 15:50:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:50:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2024-11-09 15:50:02,111 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2024-11-09 15:50:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 15:50:02,113 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2024-11-09 15:50:02,114 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:50:02,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2024-11-09 15:50:02,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:50:02,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:50:02,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:50:02,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2024-11-09 15:50:02,117 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:50:02,118 INFO L745 eck$LassoCheckResult]: Stem: 642#$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(12, 2); 643#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~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 638#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 639#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 640#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 634#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 635#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 683#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 682#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 681#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 680#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 679#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 678#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 677#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 676#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 675#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 674#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 673#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 672#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 671#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 670#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 669#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 668#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 667#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 666#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 665#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 664#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 663#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 662#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 661#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 660#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 659#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 658#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 657#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 656#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 655#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 654#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 653#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 652#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 651#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 650#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 649#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 648#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 647#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 646#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 645#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 644#L25-3 assume !(main_~i~0#1 < 2048); 641#L25-4 main_~i~0#1 := 0; 636#L29-3 [2024-11-09 15:50:02,120 INFO L747 eck$LassoCheckResult]: Loop: 636#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 637#L29-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 636#L29-3 [2024-11-09 15:50:02,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:50:02,121 INFO L85 PathProgramCache]: Analyzing trace with hash 828161207, now seen corresponding path program 4 times [2024-11-09 15:50:02,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:50:02,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035263131] [2024-11-09 15:50:02,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:50:02,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:50:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:50:02,950 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-09 15:50:02,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:50:02,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035263131] [2024-11-09 15:50:02,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035263131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:50:02,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13566510] [2024-11-09 15:50:02,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:50:02,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:50:02,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:50:02,954 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:50:02,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 15:50:03,103 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:50:03,103 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:50:03,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:50:03,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:50:03,202 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-09 15:50:03,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:50:04,003 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-09 15:50:04,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13566510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:50:04,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:50:04,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-09 15:50:04,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79976109] [2024-11-09 15:50:04,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:50:04,005 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:50:04,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:50:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2024-11-09 15:50:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:50:04,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541881707] [2024-11-09 15:50:04,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:50:04,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:50:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:50:04,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:50:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:50:04,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:50:04,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:50:04,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 15:50:04,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 15:50:04,080 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:50:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:50:04,482 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2024-11-09 15:50:04,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 190 transitions. [2024-11-09 15:50:04,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:50:04,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 190 transitions. [2024-11-09 15:50:04,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2024-11-09 15:50:04,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2024-11-09 15:50:04,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 190 transitions. [2024-11-09 15:50:04,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:50:04,489 INFO L218 hiAutomatonCegarLoop]: Abstraction has 189 states and 190 transitions. [2024-11-09 15:50:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 190 transitions. [2024-11-09 15:50:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 98. [2024-11-09 15:50:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:50:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2024-11-09 15:50:04,495 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2024-11-09 15:50:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-09 15:50:04,496 INFO L425 stractBuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2024-11-09 15:50:04,496 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:50:04,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2024-11-09 15:50:04,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:50:04,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:50:04,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:50:04,502 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2024-11-09 15:50:04,502 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:50:04,506 INFO L745 eck$LassoCheckResult]: Stem: 1215#$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(12, 2); 1216#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~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 1211#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1212#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1213#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1207#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1208#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1304#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1303#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1302#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1301#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1300#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1299#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1298#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1297#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1296#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1295#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1294#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1293#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1292#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1291#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1290#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1289#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1288#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1287#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1286#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1285#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1284#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1283#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1282#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1281#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1280#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1279#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1278#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1277#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1276#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1275#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1274#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1273#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1272#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1271#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1270#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1269#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1268#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1267#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1266#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1265#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1264#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1263#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1262#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1261#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1260#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1259#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1258#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1257#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1256#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1255#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1254#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1253#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1252#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1251#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1250#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1249#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1248#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1247#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1246#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1245#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1244#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1243#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1242#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1241#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1240#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1239#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1238#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1237#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1236#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1235#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1234#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1233#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1232#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1231#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1230#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1229#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1228#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1227#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1226#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1225#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1224#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1223#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1222#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1221#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1220#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1219#L25-3 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1218#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1217#L25-3 assume !(main_~i~0#1 < 2048); 1214#L25-4 main_~i~0#1 := 0; 1209#L29-3 [2024-11-09 15:50:04,506 INFO L747 eck$LassoCheckResult]: Loop: 1209#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 1210#L29-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1209#L29-3 [2024-11-09 15:50:04,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:50:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash 830581479, now seen corresponding path program 5 times [2024-11-09 15:50:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:50:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435075273] [2024-11-09 15:50:04,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:50:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:50:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:50:06,794 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-09 15:50:06,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:50:06,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435075273] [2024-11-09 15:50:06,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435075273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:50:06,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732456826] [2024-11-09 15:50:06,795 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 15:50:06,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:50:06,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:50:06,798 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:50:06,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process