./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.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 fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:05:39,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:05:39,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-13 17:05:39,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:05:39,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:05:40,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:05:40,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:05:40,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:05:40,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:05:40,020 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:05:40,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:05:40,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:05:40,021 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:05:40,023 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:05:40,023 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:05:40,023 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:05:40,024 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:05:40,024 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:05:40,024 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:05:40,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:05:40,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:05:40,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 17:05:40,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:05:40,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 17:05:40,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:05:40,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:05:40,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:05:40,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:05:40,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:05:40,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:05:40,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 17:05:40,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:05:40,032 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:05:40,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:05:40,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:05:40,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:05:40,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:05:40,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:05:40,035 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:05:40,035 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 -> fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 [2024-10-13 17:05:40,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:05:40,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:05:40,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:05:40,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:05:40,311 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:05:40,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2024-10-13 17:05:41,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:05:41,988 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:05:41,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2024-10-13 17:05:41,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f8110d5/9dd4d2ed57f341719b9c35a928896e47/FLAGbb7f52833 [2024-10-13 17:05:42,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f8110d5/9dd4d2ed57f341719b9c35a928896e47 [2024-10-13 17:05:42,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:05:42,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:05:42,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:05:42,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:05:42,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:05:42,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78570f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42, skipping insertion in model container [2024-10-13 17:05:42,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:05:42,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:05:42,206 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:05:42,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:05:42,232 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:05:42,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42 WrapperNode [2024-10-13 17:05:42,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:05:42,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:05:42,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:05:42,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:05:42,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,264 INFO L138 Inliner]: procedures = 15, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-10-13 17:05:42,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:05:42,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:05:42,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:05:42,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:05:42,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,299 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-10-13 17:05:42,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:05:42,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:05:42,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:05:42,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:05:42,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (1/1) ... [2024-10-13 17:05:42,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:42,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:42,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:05:42,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 17:05:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 17:05:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 17:05:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 17:05:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 17:05:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:05:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 17:05:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:05:42,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:05:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:05:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 17:05:42,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:05:42,485 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:05:42,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:05:42,647 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 17:05:42,649 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:05:42,664 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:05:42,665 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 17:05:42,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:05:42 BoogieIcfgContainer [2024-10-13 17:05:42,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:05:42,667 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:05:42,667 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:05:42,670 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:05:42,671 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:05:42,672 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:05:42" (1/3) ... [2024-10-13 17:05:42,673 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54ec4665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:05:42, skipping insertion in model container [2024-10-13 17:05:42,674 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:05:42,674 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:42" (2/3) ... [2024-10-13 17:05:42,674 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54ec4665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:05:42, skipping insertion in model container [2024-10-13 17:05:42,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:05:42,675 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:05:42" (3/3) ... [2024-10-13 17:05:42,676 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2024-10-13 17:05:42,736 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:05:42,736 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:05:42,736 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:05:42,737 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:05:42,737 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:05:42,737 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:05:42,737 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:05:42,737 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:05:42,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:42,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:05:42,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:42,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:42,760 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:05:42,760 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:05:42,760 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:05:42,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:42,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:05:42,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:42,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:42,762 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:05:42,762 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:05:42,769 INFO L745 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 13#L18-3true [2024-10-13 17:05:42,770 INFO L747 eck$LassoCheckResult]: Loop: 13#L18-3true assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 12#L18-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 13#L18-3true [2024-10-13 17:05:42,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 17:05:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:42,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560364811] [2024-10-13 17:05:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:42,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:42,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:42,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:42,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:42,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-13 17:05:42,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:42,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116571319] [2024-10-13 17:05:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:42,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:42,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:42,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-13 17:05:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:42,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333947375] [2024-10-13 17:05:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:42,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:43,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:43,386 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:05:43,387 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:05:43,387 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:05:43,387 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:05:43,388 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:05:43,388 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,388 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:05:43,388 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:05:43,388 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2024-10-13 17:05:43,388 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:05:43,389 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:05:43,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:43,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:43,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:43,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:43,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:43,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:43,886 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:05:43,889 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:05:43,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:05:43,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 17:05:43,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:43,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:43,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:43,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-13 17:05:43,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,938 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:05:43,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 17:05:43,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:43,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:43,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:43,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-13 17:05:43,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:05:43,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 17:05:43,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:43,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:43,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:44,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:44,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-13 17:05:44,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:44,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:44,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:05:44,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 17:05:44,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:44,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:44,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:44,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:44,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:44,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:44,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:44,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:44,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-13 17:05:44,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:44,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:44,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:05:44,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-13 17:05:44,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:44,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:44,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:44,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:44,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:44,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:44,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:44,093 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:05:44,124 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-10-13 17:05:44,124 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-13 17:05:44,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:44,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:44,134 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:05:44,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-13 17:05:44,138 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:05:44,153 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:05:44,153 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:05:44,154 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2024-10-13 17:05:44,170 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-10-13 17:05:44,182 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-13 17:05:44,193 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 17:05:44,195 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-13 17:05:44,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:44,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:05:44,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:44,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:05:44,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:05:44,323 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:05:44,325 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:44,373 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 32 states and 45 transitions. Complement of second has 6 states. [2024-10-13 17:05:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 17:05:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-10-13 17:05:44,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-13 17:05:44,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:44,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-13 17:05:44,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:44,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-13 17:05:44,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:44,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2024-10-13 17:05:44,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:44,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 14 states and 19 transitions. [2024-10-13 17:05:44,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:05:44,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:05:44,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2024-10-13 17:05:44,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:44,396 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-13 17:05:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2024-10-13 17:05:44,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-13 17:05:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2024-10-13 17:05:44,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-13 17:05:44,421 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-13 17:05:44,421 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:05:44,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2024-10-13 17:05:44,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:44,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:44,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:44,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 17:05:44,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:05:44,423 INFO L745 eck$LassoCheckResult]: Stem: 114#$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(24, 2); 106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 107#L18-3 assume !(main_~i~0#1 < 100000); 113#L18-4 main_~i~0#1 := 0; 105#L22-3 [2024-10-13 17:05:44,423 INFO L747 eck$LassoCheckResult]: Loop: 105#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110#L13 assume !(0 == __VERIFIER_assert_~cond#1); 102#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 103#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 104#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 105#L22-3 [2024-10-13 17:05:44,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:44,424 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-10-13 17:05:44,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:44,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916496164] [2024-10-13 17:05:44,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:44,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:05:44,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916496164] [2024-10-13 17:05:44,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916496164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:44,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:05:44,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:05:44,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663042651] [2024-10-13 17:05:44,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:44,494 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:44,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash 51965533, now seen corresponding path program 1 times [2024-10-13 17:05:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:44,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400997319] [2024-10-13 17:05:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:44,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:44,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:44,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:44,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:44,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:05:44,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:05:44,641 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:44,665 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-10-13 17:05:44,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2024-10-13 17:05:44,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:05:44,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 19 transitions. [2024-10-13 17:05:44,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 17:05:44,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:05:44,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2024-10-13 17:05:44,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:44,670 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-10-13 17:05:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2024-10-13 17:05:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2024-10-13 17:05:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-10-13 17:05:44,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-13 17:05:44,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:05:44,674 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-13 17:05:44,675 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:05:44,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2024-10-13 17:05:44,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:05:44,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:44,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:44,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:44,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:05:44,678 INFO L745 eck$LassoCheckResult]: Stem: 152#$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(24, 2); 153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 146#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 144#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 145#L18-3 assume !(main_~i~0#1 < 100000); 147#L18-4 main_~i~0#1 := 0; 148#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 156#L13 assume !(0 == __VERIFIER_assert_~cond#1); 155#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 149#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 150#L22-2 [2024-10-13 17:05:44,678 INFO L747 eck$LassoCheckResult]: Loop: 150#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 154#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 142#L13 assume !(0 == __VERIFIER_assert_~cond#1); 143#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 151#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 150#L22-2 [2024-10-13 17:05:44,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1436013086, now seen corresponding path program 1 times [2024-10-13 17:05:44,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:44,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960181319] [2024-10-13 17:05:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:44,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:05:44,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:44,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960181319] [2024-10-13 17:05:44,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960181319] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:05:44,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370313825] [2024-10-13 17:05:44,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:44,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:05:44,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:44,794 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:05:44,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 17:05:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:44,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 17:05:44,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:05:44,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:05:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:05:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370313825] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:05:44,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:05:44,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-13 17:05:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711720369] [2024-10-13 17:05:44,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:05:44,869 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:44,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 2 times [2024-10-13 17:05:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:44,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494847105] [2024-10-13 17:05:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:44,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:44,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 17:05:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 17:05:44,999 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:45,059 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-10-13 17:05:45,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2024-10-13 17:05:45,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-13 17:05:45,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 36 transitions. [2024-10-13 17:05:45,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-13 17:05:45,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-13 17:05:45,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2024-10-13 17:05:45,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:45,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-10-13 17:05:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2024-10-13 17:05:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2024-10-13 17:05:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-10-13 17:05:45,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-13 17:05:45,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 17:05:45,081 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-13 17:05:45,081 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:05:45,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2024-10-13 17:05:45,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:05:45,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:45,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:45,083 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 17:05:45,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:05:45,083 INFO L745 eck$LassoCheckResult]: Stem: 265#$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(24, 2); 266#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 258#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 259#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 260#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 256#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 257#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 272#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 271#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 270#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 269#L18-3 assume !(main_~i~0#1 < 100000); 261#L18-4 main_~i~0#1 := 0; 262#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 275#L13 assume !(0 == __VERIFIER_assert_~cond#1); 273#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 274#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 276#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 277#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 279#L13 assume !(0 == __VERIFIER_assert_~cond#1); 278#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 263#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 264#L22-2 [2024-10-13 17:05:45,084 INFO L747 eck$LassoCheckResult]: Loop: 264#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 268#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 254#L13 assume !(0 == __VERIFIER_assert_~cond#1); 255#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 267#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 264#L22-2 [2024-10-13 17:05:45,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:45,084 INFO L85 PathProgramCache]: Analyzing trace with hash -491148388, now seen corresponding path program 1 times [2024-10-13 17:05:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:45,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666213232] [2024-10-13 17:05:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:45,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:45,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-13 17:05:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:05:45,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:45,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666213232] [2024-10-13 17:05:45,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666213232] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:05:45,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259355383] [2024-10-13 17:05:45,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:45,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:05:45,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:45,281 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:05:45,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 17:05:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:45,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:05:45,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:05:45,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:05:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:05:45,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259355383] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:05:45,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:05:45,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-13 17:05:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786257626] [2024-10-13 17:05:45,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:05:45,454 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:45,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:45,454 INFO L85 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 3 times [2024-10-13 17:05:45,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:45,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969405320] [2024-10-13 17:05:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:45,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:45,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:45,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 17:05:45,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-13 17:05:45,574 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:45,686 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-10-13 17:05:45,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 81 transitions. [2024-10-13 17:05:45,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2024-10-13 17:05:45,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 81 transitions. [2024-10-13 17:05:45,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-10-13 17:05:45,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-10-13 17:05:45,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 81 transitions. [2024-10-13 17:05:45,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:45,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 81 transitions. [2024-10-13 17:05:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 81 transitions. [2024-10-13 17:05:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2024-10-13 17:05:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2024-10-13 17:05:45,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 55 transitions. [2024-10-13 17:05:45,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 17:05:45,705 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2024-10-13 17:05:45,705 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:05:45,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 55 transitions. [2024-10-13 17:05:45,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:05:45,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:45,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:45,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2024-10-13 17:05:45,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:05:45,708 INFO L745 eck$LassoCheckResult]: Stem: 502#$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(24, 2); 503#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 495#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 496#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 497#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 493#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 494#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 521#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 520#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 519#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 518#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 517#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 516#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 515#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 514#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 513#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 512#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 511#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 510#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 509#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 508#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 507#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 506#L18-3 assume !(main_~i~0#1 < 100000); 498#L18-4 main_~i~0#1 := 0; 499#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 525#L13 assume !(0 == __VERIFIER_assert_~cond#1); 543#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 542#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 526#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 527#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 524#L13 assume !(0 == __VERIFIER_assert_~cond#1); 522#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 523#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 528#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 541#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 540#L13 assume !(0 == __VERIFIER_assert_~cond#1); 539#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 538#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 537#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 536#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 535#L13 assume !(0 == __VERIFIER_assert_~cond#1); 534#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 533#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 532#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 531#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 530#L13 assume !(0 == __VERIFIER_assert_~cond#1); 529#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 500#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 501#L22-2 [2024-10-13 17:05:45,709 INFO L747 eck$LassoCheckResult]: Loop: 501#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 505#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 491#L13 assume !(0 == __VERIFIER_assert_~cond#1); 492#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 504#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 501#L22-2 [2024-10-13 17:05:45,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash -884242768, now seen corresponding path program 2 times [2024-10-13 17:05:45,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:45,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242781094] [2024-10-13 17:05:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:45,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-13 17:05:46,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:46,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242781094] [2024-10-13 17:05:46,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242781094] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:05:46,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037586388] [2024-10-13 17:05:46,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:05:46,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:05:46,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:46,032 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-10-13 17:05:46,033 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-10-13 17:05:46,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:05:46,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:05:46,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 17:05:46,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-13 17:05:46,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:05:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-13 17:05:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037586388] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:05:46,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:05:46,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-10-13 17:05:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184306479] [2024-10-13 17:05:46,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:05:46,454 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:46,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 4 times [2024-10-13 17:05:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:46,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898751055] [2024-10-13 17:05:46,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:46,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:46,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:46,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:46,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 17:05:46,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-10-13 17:05:46,565 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:46,841 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2024-10-13 17:05:46,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2024-10-13 17:05:46,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2024-10-13 17:05:46,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 171 transitions. [2024-10-13 17:05:46,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2024-10-13 17:05:46,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2024-10-13 17:05:46,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 171 transitions. [2024-10-13 17:05:46,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:46,850 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 171 transitions. [2024-10-13 17:05:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 171 transitions. [2024-10-13 17:05:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2024-10-13 17:05:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2024-10-13 17:05:46,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2024-10-13 17:05:46,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 17:05:46,864 INFO L425 stractBuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2024-10-13 17:05:46,864 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:05:46,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 109 transitions. [2024-10-13 17:05:46,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:05:46,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:46,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:46,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2024-10-13 17:05:46,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:05:46,871 INFO L745 eck$LassoCheckResult]: Stem: 1024#$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(24, 2); 1025#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1017#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1018#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1019#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1015#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1016#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1067#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1066#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1065#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1064#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1063#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1062#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1061#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1060#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1059#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1058#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1057#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1056#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1055#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1054#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1053#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1052#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1051#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1050#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1049#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1048#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1047#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1046#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1045#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1044#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1043#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1042#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1041#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1040#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1039#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1038#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1037#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1036#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1035#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1034#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1033#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1032#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1031#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1030#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1029#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1028#L18-3 assume !(main_~i~0#1 < 100000); 1020#L18-4 main_~i~0#1 := 0; 1021#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1071#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1119#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1118#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1072#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1073#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1070#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1068#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1069#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1074#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1117#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1116#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1115#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1114#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1113#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1112#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1111#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1110#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1109#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1108#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1107#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1106#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1105#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1104#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1103#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1102#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1101#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1100#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1099#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1098#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1097#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1096#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1095#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1094#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1093#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1092#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1091#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1090#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1089#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1088#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1087#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1086#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1085#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1084#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1083#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1082#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1081#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1080#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1079#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1078#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1077#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1076#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1075#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1022#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1023#L22-2 [2024-10-13 17:05:46,871 INFO L747 eck$LassoCheckResult]: Loop: 1023#L22-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1027#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1013#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1014#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1026#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1023#L22-2 [2024-10-13 17:05:46,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash -553358392, now seen corresponding path program 3 times [2024-10-13 17:05:46,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:46,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817880205] [2024-10-13 17:05:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-13 17:05:47,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817880205] [2024-10-13 17:05:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817880205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:05:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377870614] [2024-10-13 17:05:47,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 17:05:47,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:05:47,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,802 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-10-13 17:05:47,804 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-10-13 17:05:47,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 17:05:47,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:05:47,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 17:05:47,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:47,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-13 17:05:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2024-10-13 17:05:48,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 17:05:48,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377870614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:48,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 17:05:48,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 28 [2024-10-13 17:05:48,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091816790] [2024-10-13 17:05:48,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:48,028 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:48,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:48,029 INFO L85 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 5 times [2024-10-13 17:05:48,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:48,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180395637] [2024-10-13 17:05:48,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:48,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:48,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:48,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:48,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:48,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 17:05:48,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2024-10-13 17:05:48,151 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:05:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:48,193 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2024-10-13 17:05:48,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 55 transitions. [2024-10-13 17:05:48,194 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:05:48,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2024-10-13 17:05:48,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-13 17:05:48,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-13 17:05:48,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-13 17:05:48,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:48,194 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:05:48,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:05:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 17:05:48,195 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:05:48,195 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:05:48,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-13 17:05:48,195 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:05:48,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-13 17:05:48,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:05:48 BoogieIcfgContainer [2024-10-13 17:05:48,203 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:05:48,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:05:48,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:05:48,203 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:05:48,204 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:05:42" (3/4) ... [2024-10-13 17:05:48,205 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 17:05:48,207 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:05:48,207 INFO L158 Benchmark]: Toolchain (without parser) took 6196.17ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 105.2MB in the beginning and 168.1MB in the end (delta: -62.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-10-13 17:05:48,208 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 161.5MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:05:48,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.01ms. Allocated memory is still 161.5MB. Free memory was 104.7MB in the beginning and 93.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 17:05:48,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.56ms. Allocated memory is still 161.5MB. Free memory was 93.1MB in the beginning and 91.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:05:48,209 INFO L158 Benchmark]: Boogie Preprocessor took 53.29ms. Allocated memory is still 161.5MB. Free memory was 91.7MB in the beginning and 89.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:05:48,209 INFO L158 Benchmark]: RCFGBuilder took 346.15ms. Allocated memory is still 161.5MB. Free memory was 89.6MB in the beginning and 78.4MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 17:05:48,210 INFO L158 Benchmark]: BuchiAutomizer took 5536.12ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 78.4MB in the beginning and 169.1MB in the end (delta: -90.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:05:48,210 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 249.6MB. Free memory was 169.1MB in the beginning and 168.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:05:48,212 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 161.5MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.01ms. Allocated memory is still 161.5MB. Free memory was 104.7MB in the beginning and 93.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.56ms. Allocated memory is still 161.5MB. Free memory was 93.1MB in the beginning and 91.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.29ms. Allocated memory is still 161.5MB. Free memory was 91.7MB in the beginning and 89.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 346.15ms. Allocated memory is still 161.5MB. Free memory was 89.6MB in the beginning and 78.4MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 5536.12ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 78.4MB in the beginning and 169.1MB in the end (delta: -90.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 249.6MB. Free memory was 169.1MB in the beginning and 168.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 7 iterations. TraceHistogramMax:22. Analysis of lassos took 4.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 553 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 552 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 39 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital117 mio100 ax100 hnf100 lsp88 ukn75 mio100 lsp43 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-13 17:05:48,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-13 17:05:48,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:48,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 17:05:48,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:49,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE