./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:42:12,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:42:12,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 22:42:12,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:42:12,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:42:12,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:42:12,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:42:12,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:42:12,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:42:12,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:42:12,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:42:12,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:42:12,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:42:12,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:42:12,439 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:42:12,446 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:42:12,446 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:42:12,446 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:42:12,447 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:42:12,447 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:42:12,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:42:12,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:42:12,449 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 22:42:12,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:42:12,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 22:42:12,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:42:12,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:42:12,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:42:12,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:42:12,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:42:12,450 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:42:12,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 22:42:12,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:42:12,451 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:42:12,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:42:12,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:42:12,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:42:12,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:42:12,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:42:12,453 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:42:12,453 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-11-10 22:42:12,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:42:12,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:42:12,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:42:12,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:42:12,715 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:42:12,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2024-11-10 22:42:14,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:42:14,361 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:42:14,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2024-11-10 22:42:14,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bcbc9b23/ea64828e96c844268f5e1611fb0929ba/FLAGb8c2631d3 [2024-11-10 22:42:14,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bcbc9b23/ea64828e96c844268f5e1611fb0929ba [2024-11-10 22:42:14,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:42:14,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:42:14,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:42:14,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:42:14,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:42:14,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d21ada8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14, skipping insertion in model container [2024-11-10 22:42:14,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:42:14,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:42:14,607 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:42:14,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:42:14,644 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:42:14,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14 WrapperNode [2024-11-10 22:42:14,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:42:14,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:42:14,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:42:14,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:42:14,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,677 INFO L138 Inliner]: procedures = 15, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-11-10 22:42:14,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:42:14,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:42:14,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:42:14,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:42:14,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,710 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-10 22:42:14,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:42:14,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:42:14,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:42:14,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:42:14,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (1/1) ... [2024-11-10 22:42:14,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:14,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:14,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:14,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 22:42:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 22:42:14,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 22:42:14,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 22:42:14,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 22:42:14,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 22:42:14,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 22:42:14,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:42:14,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:42:14,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 22:42:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 22:42:14,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 22:42:14,901 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:42:14,903 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:42:15,047 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2024-11-10 22:42:15,054 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 22:42:15,054 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:42:15,068 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:42:15,069 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:42:15,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:42:15 BoogieIcfgContainer [2024-11-10 22:42:15,069 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:42:15,070 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:42:15,070 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:42:15,074 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:42:15,075 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:42:15,075 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:42:14" (1/3) ... [2024-11-10 22:42:15,076 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1be71fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:42:15, skipping insertion in model container [2024-11-10 22:42:15,076 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:42:15,076 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:14" (2/3) ... [2024-11-10 22:42:15,077 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1be71fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:42:15, skipping insertion in model container [2024-11-10 22:42:15,077 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:42:15,077 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:42:15" (3/3) ... [2024-11-10 22:42:15,078 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2024-11-10 22:42:15,131 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:42:15,131 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:42:15,131 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:42:15,131 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:42:15,132 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:42:15,132 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:42:15,132 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:42:15,132 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:42:15,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:15,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-10 22:42:15,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:15,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:15,157 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:42:15,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:42:15,157 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:42:15,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:15,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-10 22:42:15,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:15,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:15,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:42:15,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:42:15,164 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue 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); 14#ULTIMATE.init_returnLabel#1true assume true;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; 11#L18true [2024-11-10 22:42:15,165 INFO L747 eck$LassoCheckResult]: Loop: 11#L18true assume true; 4#L18-1true 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 11#L18true [2024-11-10 22:42:15,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1856, now seen corresponding path program 1 times [2024-11-10 22:42:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:15,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484614611] [2024-11-10 22:42:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:15,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:15,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:15,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:15,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:15,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1760, now seen corresponding path program 1 times [2024-11-10 22:42:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:15,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528687414] [2024-11-10 22:42:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:15,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:15,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:15,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:15,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1784415, now seen corresponding path program 1 times [2024-11-10 22:42:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:15,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017105069] [2024-11-10 22:42:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:15,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:15,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:15,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:15,726 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:42:15,727 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:42:15,728 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:42:15,728 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:42:15,728 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:42:15,729 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:15,729 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:42:15,729 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:42:15,730 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2024-11-10 22:42:15,730 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:42:15,730 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:42:15,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:15,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:15,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:15,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:15,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:16,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:16,217 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:42:16,221 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:42:16,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 22:42:16,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:16,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:16,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-10 22:42:16,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 22:42:16,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:16,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:16,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-10 22:42:16,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,304 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 22:42:16,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:16,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:16,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:16,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-10 22:42:16,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 22:42:16,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:16,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:16,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:16,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-10 22:42:16,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 22:42:16,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:16,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:16,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:16,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 22:42:16,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 22:42:16,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:16,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:16,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 22:42:16,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,463 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 22:42:16,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:16,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:16,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 22:42:16,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,507 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 22:42:16,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:16,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:16,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:16,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,549 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 22:42:16,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:16,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:16,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:16,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,594 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 22:42:16,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:16,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:16,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-10 22:42:16,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,633 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 22:42:16,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:16,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:16,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-10 22:42:16,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,673 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 22:42:16,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:16,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:16,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:16,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-10 22:42:16,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,715 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 22:42:16,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:16,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:16,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:16,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:16,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:16,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:16,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:16,742 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:42:16,778 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-11-10 22:42:16,779 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-10 22:42:16,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:16,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:16,805 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:42:16,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 22:42:16,810 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:42:16,825 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:42:16,825 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:42:16,826 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-11-10 22:42:16,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:16,853 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-10 22:42:16,861 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:42:16,862 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:42:16,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:16,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:42:16,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:16,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:42:16,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:16,971 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:42:16,973 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:17,006 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 46 transitions. Complement of second has 6 states. [2024-11-10 22:42:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:42:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-10 22:42:17,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-10 22:42:17,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:42:17,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-10 22:42:17,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:42:17,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-10 22:42:17,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:42:17,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 46 transitions. [2024-11-10 22:42:17,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-10 22:42:17,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 16 states and 21 transitions. [2024-11-10 22:42:17,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:42:17,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:42:17,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2024-11-10 22:42:17,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:17,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-10 22:42:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2024-11-10 22:42:17,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-10 22:42:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2024-11-10 22:42:17,058 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-10 22:42:17,058 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-10 22:42:17,058 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:42:17,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2024-11-10 22:42:17,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-10 22:42:17,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:17,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:17,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:42:17,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-10 22:42:17,061 INFO L745 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY 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); 112#ULTIMATE.init_returnLabel#1 assume true;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; 118#L18 assume true; 105#L18-1 assume !(main_~i~0#1 < 100000); 106#L22-3 main_~i~0#1 := 0; 110#L22 [2024-11-10 22:42:17,062 INFO L747 eck$LassoCheckResult]: Loop: 110#L22 assume true; 116#L22-2 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; 117#L13 assume !(0 == __VERIFIER_assert_~cond#1); 104#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 115#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); 109#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 110#L22 [2024-11-10 22:42:17,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash 55316823, now seen corresponding path program 1 times [2024-11-10 22:42:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:17,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154452979] [2024-11-10 22:42:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:17,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:17,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154452979] [2024-11-10 22:42:17,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154452979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:42:17,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:42:17,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:42:17,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492135519] [2024-11-10 22:42:17,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:42:17,145 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:17,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1418922425, now seen corresponding path program 1 times [2024-11-10 22:42:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:17,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749486471] [2024-11-10 22:42:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:17,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:17,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:17,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:17,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:42:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:42:17,316 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:17,336 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-10 22:42:17,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2024-11-10 22:42:17,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:42:17,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 22 transitions. [2024-11-10 22:42:17,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-10 22:42:17,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-10 22:42:17,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2024-11-10 22:42:17,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:17,339 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 22:42:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2024-11-10 22:42:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-10 22:42:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-10 22:42:17,341 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-10 22:42:17,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:42:17,343 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-10 22:42:17,343 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:42:17,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2024-11-10 22:42:17,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:42:17,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:17,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:17,344 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:42:17,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-10 22:42:17,345 INFO L745 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY 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); 162#ULTIMATE.init_returnLabel#1 assume true;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; 150#L18 assume true; 151#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 152#L18 assume true; 153#L18-1 assume !(main_~i~0#1 < 100000); 156#L22-3 main_~i~0#1 := 0; 154#L22 assume true; 155#L22-2 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; 157#L13 assume !(0 == __VERIFIER_assert_~cond#1); 158#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 163#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); 159#L22-1 [2024-11-10 22:42:17,345 INFO L747 eck$LassoCheckResult]: Loop: 159#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 160#L22 assume true; 167#L22-2 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; 166#L13 assume !(0 == __VERIFIER_assert_~cond#1); 165#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 164#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); 159#L22-1 [2024-11-10 22:42:17,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:17,345 INFO L85 PathProgramCache]: Analyzing trace with hash 261317684, now seen corresponding path program 1 times [2024-11-10 22:42:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:17,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620784617] [2024-11-10 22:42:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:17,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:17,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620784617] [2024-11-10 22:42:17,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620784617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042429198] [2024-11-10 22:42:17,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:17,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:17,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:17,431 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:17,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 22:42:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:17,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 22:42:17,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:17,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:42:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:17,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042429198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:42:17,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:42:17,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-10 22:42:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097022667] [2024-11-10 22:42:17,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:42:17,521 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:17,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1019162825, now seen corresponding path program 2 times [2024-11-10 22:42:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:17,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21722896] [2024-11-10 22:42:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:17,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:17,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:17,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:17,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 22:42:17,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 22:42:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 22:42:17,719 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:17,766 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-10 22:42:17,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 46 transitions. [2024-11-10 22:42:17,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-10 22:42:17,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 43 transitions. [2024-11-10 22:42:17,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-10 22:42:17,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-10 22:42:17,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 43 transitions. [2024-11-10 22:42:17,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:17,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-11-10 22:42:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 43 transitions. [2024-11-10 22:42:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2024-11-10 22:42:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-10 22:42:17,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-10 22:42:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 22:42:17,774 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-10 22:42:17,775 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:42:17,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2024-11-10 22:42:17,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:42:17,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:17,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:17,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 22:42:17,777 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-10 22:42:17,777 INFO L745 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY 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); 300#ULTIMATE.init_returnLabel#1 assume true;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; 287#L18 assume true; 288#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 289#L18 assume true; 290#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 295#L18 assume true; 310#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 309#L18 assume true; 308#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 307#L18 assume true; 293#L18-1 assume !(main_~i~0#1 < 100000); 294#L22-3 main_~i~0#1 := 0; 304#L22 assume true; 305#L22-2 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; 306#L13 assume !(0 == __VERIFIER_assert_~cond#1); 301#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 302#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); 316#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 314#L22 assume true; 315#L22-2 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; 296#L13 assume !(0 == __VERIFIER_assert_~cond#1); 297#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 303#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); 298#L22-1 [2024-11-10 22:42:17,777 INFO L747 eck$LassoCheckResult]: Loop: 298#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 291#L22 assume true; 292#L22-2 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; 313#L13 assume !(0 == __VERIFIER_assert_~cond#1); 312#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 311#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); 298#L22-1 [2024-11-10 22:42:17,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1652805927, now seen corresponding path program 1 times [2024-11-10 22:42:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:17,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539467151] [2024-11-10 22:42:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 22:42:17,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:17,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539467151] [2024-11-10 22:42:17,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539467151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:17,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424317029] [2024-11-10 22:42:17,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:17,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:17,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:17,954 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:17,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-10 22:42:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:18,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:42:18,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 22:42:18,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:42:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 22:42:18,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424317029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:42:18,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:42:18,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 22:42:18,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728991371] [2024-11-10 22:42:18,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:42:18,131 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:18,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:18,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1019162825, now seen corresponding path program 3 times [2024-11-10 22:42:18,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:18,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128525705] [2024-11-10 22:42:18,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:18,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:18,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:18,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:18,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:18,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 22:42:18,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 22:42:18,267 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:18,395 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2024-11-10 22:42:18,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 100 transitions. [2024-11-10 22:42:18,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-11-10 22:42:18,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 88 states and 94 transitions. [2024-11-10 22:42:18,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-11-10 22:42:18,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2024-11-10 22:42:18,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 94 transitions. [2024-11-10 22:42:18,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:18,403 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 94 transitions. [2024-11-10 22:42:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 94 transitions. [2024-11-10 22:42:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2024-11-10 22:42:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2024-11-10 22:42:18,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 62 transitions. [2024-11-10 22:42:18,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 22:42:18,413 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2024-11-10 22:42:18,413 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:42:18,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 62 transitions. [2024-11-10 22:42:18,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:42:18,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:18,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:18,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2024-11-10 22:42:18,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-10 22:42:18,421 INFO L745 eck$LassoCheckResult]: Stem: 574#ULTIMATE.startENTRY 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); 575#ULTIMATE.init_returnLabel#1 assume true;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; 567#L18 assume true; 568#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 569#L18 assume true; 570#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 597#L18 assume true; 596#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 595#L18 assume true; 594#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 593#L18 assume true; 592#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 591#L18 assume true; 590#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 589#L18 assume true; 588#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 587#L18 assume true; 586#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 585#L18 assume true; 584#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 583#L18 assume true; 582#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 581#L18 assume true; 576#L18-1 assume !(main_~i~0#1 < 100000); 577#L22-3 main_~i~0#1 := 0; 580#L22 assume true; 624#L22-2 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; 623#L13 assume !(0 == __VERIFIER_assert_~cond#1); 622#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 604#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); 603#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 602#L22 assume true; 601#L22-2 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; 600#L13 assume !(0 == __VERIFIER_assert_~cond#1); 598#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 599#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); 621#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 620#L22 assume true; 619#L22-2 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; 618#L13 assume !(0 == __VERIFIER_assert_~cond#1); 617#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 616#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); 615#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 614#L22 assume true; 613#L22-2 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; 612#L13 assume !(0 == __VERIFIER_assert_~cond#1); 611#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 610#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); 609#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 608#L22 assume true; 607#L22-2 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; 606#L13 assume !(0 == __VERIFIER_assert_~cond#1); 605#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 579#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); 571#L22-1 [2024-11-10 22:42:18,421 INFO L747 eck$LassoCheckResult]: Loop: 571#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 565#L22 assume true; 566#L22-2 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; 572#L13 assume !(0 == __VERIFIER_assert_~cond#1); 573#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 578#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); 571#L22-1 [2024-11-10 22:42:18,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:18,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2012223915, now seen corresponding path program 2 times [2024-11-10 22:42:18,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:18,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788283200] [2024-11-10 22:42:18,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-10 22:42:18,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:18,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788283200] [2024-11-10 22:42:18,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788283200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:18,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865731630] [2024-11-10 22:42:18,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:42:18,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:18,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:18,745 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:18,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-10 22:42:18,842 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:42:18,842 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:42:18,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 22:42:18,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-10 22:42:18,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:42:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-10 22:42:19,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865731630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:42:19,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:42:19,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-10 22:42:19,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284083350] [2024-11-10 22:42:19,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:42:19,165 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:19,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1019162825, now seen corresponding path program 4 times [2024-11-10 22:42:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:19,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949387301] [2024-11-10 22:42:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:19,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:19,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:19,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:19,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 22:42:19,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-10 22:42:19,276 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:19,489 INFO L93 Difference]: Finished difference Result 196 states and 208 transitions. [2024-11-10 22:42:19,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 208 transitions. [2024-11-10 22:42:19,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2024-11-10 22:42:19,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 184 states and 196 transitions. [2024-11-10 22:42:19,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2024-11-10 22:42:19,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2024-11-10 22:42:19,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 196 transitions. [2024-11-10 22:42:19,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:19,494 INFO L218 hiAutomatonCegarLoop]: Abstraction has 184 states and 196 transitions. [2024-11-10 22:42:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 196 transitions. [2024-11-10 22:42:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 120. [2024-11-10 22:42:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 119 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2024-11-10 22:42:19,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 122 transitions. [2024-11-10 22:42:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 22:42:19,502 INFO L425 stractBuchiCegarLoop]: Abstraction has 120 states and 122 transitions. [2024-11-10 22:42:19,502 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:42:19,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 122 transitions. [2024-11-10 22:42:19,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:42:19,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:19,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:19,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2024-11-10 22:42:19,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-10 22:42:19,507 INFO L745 eck$LassoCheckResult]: Stem: 1179#ULTIMATE.startENTRY 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); 1180#ULTIMATE.init_returnLabel#1 assume true;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; 1167#L18 assume true; 1168#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1169#L18 assume true; 1170#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1175#L18 assume true; 1224#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1223#L18 assume true; 1222#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1221#L18 assume true; 1220#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1219#L18 assume true; 1218#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1217#L18 assume true; 1216#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1215#L18 assume true; 1214#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1213#L18 assume true; 1212#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1211#L18 assume true; 1210#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1209#L18 assume true; 1208#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1207#L18 assume true; 1206#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1205#L18 assume true; 1204#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1203#L18 assume true; 1202#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1201#L18 assume true; 1200#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1199#L18 assume true; 1198#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1197#L18 assume true; 1196#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1195#L18 assume true; 1194#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1193#L18 assume true; 1192#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1191#L18 assume true; 1190#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1189#L18 assume true; 1188#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1187#L18 assume true; 1186#L18-1 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);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1185#L18 assume true; 1173#L18-1 assume !(main_~i~0#1 < 100000); 1174#L22-3 main_~i~0#1 := 0; 1183#L22 assume true; 1286#L22-2 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; 1285#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1284#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1230#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); 1229#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1228#L22 assume true; 1184#L22-2 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; 1176#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1177#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1181#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); 1283#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1282#L22 assume true; 1281#L22-2 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; 1280#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1279#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1278#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); 1277#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1276#L22 assume true; 1275#L22-2 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; 1274#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1273#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1272#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); 1271#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1270#L22 assume true; 1269#L22-2 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; 1268#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1267#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1266#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); 1265#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1264#L22 assume true; 1263#L22-2 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; 1262#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1261#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1260#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); 1259#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1258#L22 assume true; 1257#L22-2 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; 1256#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1255#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1254#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); 1253#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1252#L22 assume true; 1251#L22-2 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; 1250#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1249#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1248#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); 1247#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1246#L22 assume true; 1245#L22-2 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; 1244#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1243#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1242#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); 1241#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1240#L22 assume true; 1239#L22-2 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; 1238#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1237#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1236#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); 1235#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1234#L22 assume true; 1233#L22-2 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; 1232#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1231#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1182#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); 1178#L22-1 [2024-11-10 22:42:19,507 INFO L747 eck$LassoCheckResult]: Loop: 1178#L22-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1171#L22 assume true; 1172#L22-2 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; 1227#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1226#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 1225#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); 1178#L22-1 [2024-11-10 22:42:19,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash -500995761, now seen corresponding path program 3 times [2024-11-10 22:42:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:19,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405608698] [2024-11-10 22:42:19,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:19,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-10 22:42:20,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:20,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405608698] [2024-11-10 22:42:20,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405608698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:20,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18069398] [2024-11-10 22:42:20,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 22:42:20,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:20,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:20,380 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:20,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-10 22:42:20,475 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 22:42:20,475 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:42:20,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 22:42:20,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:20,514 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 25 treesize of output 1 [2024-11-10 22:42:20,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-11-10 22:42:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2024-11-10 22:42:20,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 22:42:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18069398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:42:20,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 22:42:20,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 28 [2024-11-10 22:42:20,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128262277] [2024-11-10 22:42:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:42:20,634 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:20,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1019162825, now seen corresponding path program 5 times [2024-11-10 22:42:20,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:20,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038587716] [2024-11-10 22:42:20,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:20,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:20,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:20,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:20,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 22:42:20,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2024-11-10 22:42:20,748 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-11-10 22:42:20,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:20,787 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2024-11-10 22:42:20,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 58 transitions. [2024-11-10 22:42:20,788 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 22:42:20,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. [2024-11-10 22:42:20,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-10 22:42:20,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-10 22:42:20,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-10 22:42:20,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:42:20,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:42:20,788 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:42:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 22:42:20,789 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:42:20,789 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:42:20,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-10 22:42:20,789 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 22:42:20,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-10 22:42:20,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:42:20 BoogieIcfgContainer [2024-11-10 22:42:20,797 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:42:20,798 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:42:20,798 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:42:20,798 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:42:20,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:42:15" (3/4) ... [2024-11-10 22:42:20,800 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 22:42:20,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:42:20,801 INFO L158 Benchmark]: Toolchain (without parser) took 6416.31ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 121.2MB in the beginning and 190.3MB in the end (delta: -69.0MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2024-11-10 22:42:20,802 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:42:20,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.75ms. Allocated memory is still 176.2MB. Free memory was 121.2MB in the beginning and 108.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 22:42:20,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.51ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 107.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:42:20,802 INFO L158 Benchmark]: Boogie Preprocessor took 51.72ms. Allocated memory is still 176.2MB. Free memory was 107.4MB in the beginning and 105.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:42:20,803 INFO L158 Benchmark]: IcfgBuilder took 338.82ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 93.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 22:42:20,803 INFO L158 Benchmark]: BuchiAutomizer took 5726.96ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 93.6MB in the beginning and 190.3MB in the end (delta: -96.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:42:20,803 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 247.5MB. Free memory is still 190.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:42:20,805 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.18ms. Allocated memory is still 176.2MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.75ms. Allocated memory is still 176.2MB. Free memory was 121.2MB in the beginning and 108.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.51ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 107.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.72ms. Allocated memory is still 176.2MB. Free memory was 107.4MB in the beginning and 105.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 338.82ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 93.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5726.96ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 93.6MB in the beginning and 190.3MB in the end (delta: -96.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 247.5MB. Free memory is still 190.3MB. There was no memory consumed. 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.6s and 7 iterations. TraceHistogramMax:23. Analysis of lassos took 4.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 104 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, 466 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 215 IncrementalHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 50 mSDtfsCounter, 215 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: 28ms 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-11-10 22:42:20,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:21,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:21,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:21,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-10 22:42:21,634 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