./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 041376d57652038a5d4ee57a004231861ab6efac51c30f8b6c72783e60a27529 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:14:28,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:14:29,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:14:29,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:14:29,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:14:29,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:14:29,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:14:29,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:14:29,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:14:29,084 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:14:29,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:14:29,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:14:29,085 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:14:29,086 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:14:29,086 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:14:29,086 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:14:29,086 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:14:29,086 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:14:29,087 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:14:29,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:14:29,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:14:29,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:14:29,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:14:29,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:14:29,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:14:29,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:14:29,088 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:14:29,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:14:29,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:14:29,089 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:14:29,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:14:29,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:14:29,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:14:29,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:14:29,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:14:29,090 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:14:29,091 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 041376d57652038a5d4ee57a004231861ab6efac51c30f8b6c72783e60a27529 [2024-10-15 00:14:29,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:14:29,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:14:29,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:14:29,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:14:29,333 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:14:29,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i [2024-10-15 00:14:30,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:14:30,902 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:14:30,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i [2024-10-15 00:14:30,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a46dd79c2/c490ae767f9942aa9c7fd30dfdccf6e6/FLAGdcd867e25 [2024-10-15 00:14:31,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a46dd79c2/c490ae767f9942aa9c7fd30dfdccf6e6 [2024-10-15 00:14:31,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:14:31,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:14:31,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:14:31,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:14:31,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:14:31,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c548b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31, skipping insertion in model container [2024-10-15 00:14:31,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:14:31,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:14:31,705 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:14:31,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:14:31,782 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:14:31,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31 WrapperNode [2024-10-15 00:14:31,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:14:31,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:14:31,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:14:31,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:14:31,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,817 INFO L138 Inliner]: procedures = 110, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2024-10-15 00:14:31,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:14:31,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:14:31,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:14:31,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:14:31,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,847 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [4, 5]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [2, 3]. [2024-10-15 00:14:31,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:14:31,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:14:31,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:14:31,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:14:31,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (1/1) ... [2024-10-15 00:14:31,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:31,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:31,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:31,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:14:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:14:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 00:14:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:14:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 00:14:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 00:14:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:14:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:14:31,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:14:32,052 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:14:32,054 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:14:32,134 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-15 00:14:32,135 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:14:32,146 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:14:32,146 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 00:14:32,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:14:32 BoogieIcfgContainer [2024-10-15 00:14:32,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:14:32,148 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:14:32,148 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:14:32,151 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:14:32,153 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:14:32,153 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:14:31" (1/3) ... [2024-10-15 00:14:32,154 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e287d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:14:32, skipping insertion in model container [2024-10-15 00:14:32,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:14:32,154 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:31" (2/3) ... [2024-10-15 00:14:32,154 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e287d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:14:32, skipping insertion in model container [2024-10-15 00:14:32,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:14:32,154 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:14:32" (3/3) ... [2024-10-15 00:14:32,155 INFO L332 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca-2.i [2024-10-15 00:14:32,215 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:14:32,215 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:14:32,216 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:14:32,216 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:14:32,216 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:14:32,216 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:14:32,216 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:14:32,216 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:14:32,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:32,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:14:32,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:14:32,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:14:32,239 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:14:32,239 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:14:32,239 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:14:32,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:32,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:14:32,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:14:32,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:14:32,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:14:32,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:14:32,246 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 3#L552-3true [2024-10-15 00:14:32,247 INFO L747 eck$LassoCheckResult]: Loop: 3#L552-3true call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 11#L552-1true assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 7#L554-3true assume !true; 10#L554-4true call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 3#L552-3true [2024-10-15 00:14:32,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:32,251 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:14:32,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:32,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284625334] [2024-10-15 00:14:32,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:32,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:32,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:32,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:32,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:32,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2024-10-15 00:14:32,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:32,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401733583] [2024-10-15 00:14:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:32,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:32,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:14:32,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401733583] [2024-10-15 00:14:32,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401733583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:14:32,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:14:32,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:14:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868656875] [2024-10-15 00:14:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:14:32,456 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:14:32,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:14:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 00:14:32,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 00:14:32,482 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:14:32,486 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2024-10-15 00:14:32,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2024-10-15 00:14:32,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:14:32,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2024-10-15 00:14:32,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-15 00:14:32,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-15 00:14:32,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2024-10-15 00:14:32,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:14:32,491 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-15 00:14:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2024-10-15 00:14:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-10-15 00:14:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:32,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-10-15 00:14:32,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-15 00:14:32,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 00:14:32,533 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-15 00:14:32,537 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:14:32,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2024-10-15 00:14:32,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:14:32,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:14:32,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:14:32,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:14:32,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:14:32,539 INFO L745 eck$LassoCheckResult]: Stem: 32#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 30#L552-3 [2024-10-15 00:14:32,539 INFO L747 eck$LassoCheckResult]: Loop: 30#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 31#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 34#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 35#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 36#L554-4 call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 30#L552-3 [2024-10-15 00:14:32,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-15 00:14:32,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:32,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516368804] [2024-10-15 00:14:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:32,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:32,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:32,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2024-10-15 00:14:32,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:32,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443004661] [2024-10-15 00:14:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:32,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:14:32,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443004661] [2024-10-15 00:14:32,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443004661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:14:32,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:14:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:14:32,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207254149] [2024-10-15 00:14:32,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:14:32,764 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:14:32,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:14:32,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:14:32,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:14:32,765 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-10-15 00:14:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:14:32,837 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2024-10-15 00:14:32,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2024-10-15 00:14:32,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:14:32,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2024-10-15 00:14:32,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-15 00:14:32,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-15 00:14:32,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2024-10-15 00:14:32,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:14:32,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-10-15 00:14:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2024-10-15 00:14:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-10-15 00:14:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-10-15 00:14:32,842 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-10-15 00:14:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:14:32,845 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-10-15 00:14:32,845 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:14:32,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2024-10-15 00:14:32,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:14:32,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:14:32,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:14:32,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:14:32,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2024-10-15 00:14:32,846 INFO L745 eck$LassoCheckResult]: Stem: 59#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 60#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 55#L552-3 [2024-10-15 00:14:32,846 INFO L747 eck$LassoCheckResult]: Loop: 55#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 56#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 57#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 58#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 61#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 63#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 62#L554-4 call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 55#L552-3 [2024-10-15 00:14:32,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:32,847 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-15 00:14:32,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:32,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102555248] [2024-10-15 00:14:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:32,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:32,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:32,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:32,883 INFO L85 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2024-10-15 00:14:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:32,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990092626] [2024-10-15 00:14:32,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:14:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990092626] [2024-10-15 00:14:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990092626] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:14:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097163308] [2024-10-15 00:14:33,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:33,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:14:33,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:33,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:14:33,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 00:14:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:33,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:14:33,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:33,188 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 15 treesize of output 1 [2024-10-15 00:14:33,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-10-15 00:14:33,226 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 15 treesize of output 7 [2024-10-15 00:14:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:33,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:14:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:33,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097163308] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:14:33,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:14:33,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-10-15 00:14:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497345787] [2024-10-15 00:14:33,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:14:33,270 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:14:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:14:33,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 00:14:33,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-15 00:14:33,270 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:33,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:14:33,329 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2024-10-15 00:14:33,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2024-10-15 00:14:33,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-15 00:14:33,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2024-10-15 00:14:33,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-15 00:14:33,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-15 00:14:33,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2024-10-15 00:14:33,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:14:33,330 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-15 00:14:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2024-10-15 00:14:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-15 00:14:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-10-15 00:14:33,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-15 00:14:33,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 00:14:33,334 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-15 00:14:33,334 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:14:33,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2024-10-15 00:14:33,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-15 00:14:33,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:14:33,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:14:33,334 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:14:33,334 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2024-10-15 00:14:33,335 INFO L745 eck$LassoCheckResult]: Stem: 138#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 134#L552-3 [2024-10-15 00:14:33,335 INFO L747 eck$LassoCheckResult]: Loop: 134#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 135#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 142#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 140#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 136#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 137#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 148#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 147#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 146#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 145#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 144#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 143#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 141#L554-4 call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 134#L552-3 [2024-10-15 00:14:33,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-15 00:14:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746811713] [2024-10-15 00:14:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:33,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:33,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:33,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:33,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash 351922269, now seen corresponding path program 2 times [2024-10-15 00:14:33,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:33,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691234665] [2024-10-15 00:14:33,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:33,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:14:33,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691234665] [2024-10-15 00:14:33,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691234665] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:14:33,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104672619] [2024-10-15 00:14:33,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:14:33,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:14:33,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:33,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:14:33,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 00:14:33,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:14:33,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:14:33,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-15 00:14:33,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:33,790 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 15 treesize of output 1 [2024-10-15 00:14:33,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-10-15 00:14:33,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-10-15 00:14:33,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-10-15 00:14:33,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-10-15 00:14:33,830 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 15 treesize of output 7 [2024-10-15 00:14:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:33,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:14:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:33,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104672619] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:14:33,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:14:33,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 17 [2024-10-15 00:14:33,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457734945] [2024-10-15 00:14:33,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:14:33,921 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:14:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:14:33,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-15 00:14:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=160, Unknown=0, NotChecked=0, Total=272 [2024-10-15 00:14:33,922 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 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-10-15 00:14:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:14:34,005 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-10-15 00:14:34,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2024-10-15 00:14:34,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-15 00:14:34,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2024-10-15 00:14:34,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-15 00:14:34,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-15 00:14:34,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2024-10-15 00:14:34,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:14:34,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-10-15 00:14:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2024-10-15 00:14:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-15 00:14:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-10-15 00:14:34,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-10-15 00:14:34,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-15 00:14:34,009 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-10-15 00:14:34,009 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:14:34,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2024-10-15 00:14:34,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-15 00:14:34,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:14:34,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:14:34,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:14:34,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2024-10-15 00:14:34,013 INFO L745 eck$LassoCheckResult]: Stem: 280#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 276#L552-3 [2024-10-15 00:14:34,013 INFO L747 eck$LassoCheckResult]: Loop: 276#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 277#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 284#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 282#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 278#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 279#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 300#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 299#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 298#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 297#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 296#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 295#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 294#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 293#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 292#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 291#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 290#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 289#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 288#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 287#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 286#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 285#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 283#L554-4 call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 276#L552-3 [2024-10-15 00:14:34,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:34,014 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-15 00:14:34,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:34,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15125685] [2024-10-15 00:14:34,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:34,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:34,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:34,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:34,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1943458812, now seen corresponding path program 3 times [2024-10-15 00:14:34,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:34,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155023747] [2024-10-15 00:14:34,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:34,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:34,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:34,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:34,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 1 times [2024-10-15 00:14:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100446927] [2024-10-15 00:14:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:34,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:34,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:36,946 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:14:36,947 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:14:36,947 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:14:36,947 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:14:36,947 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:14:36,947 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:36,947 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:14:36,947 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:14:36,948 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration5_Lasso [2024-10-15 00:14:36,948 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:14:36,948 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:14:36,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:36,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:36,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:36,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:36,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:36,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:36,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:36,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:37,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:37,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:37,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:37,332 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:14:37,335 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:14:37,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:37,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:37,337 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:37,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:14:37,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:37,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:37,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:14:37,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:37,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:37,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:37,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:14:37,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:14:37,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:37,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-15 00:14:37,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:37,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:37,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:37,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 00:14:37,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:37,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:37,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:14:37,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:37,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:37,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:37,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:14:37,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:14:37,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:37,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-15 00:14:37,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:37,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:37,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:37,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 00:14:37,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:37,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:37,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:37,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:37,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:37,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:37,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:37,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:37,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-15 00:14:37,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:37,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:37,447 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:37,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:14:37,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:37,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:37,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:14:37,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:37,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:37,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:37,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:14:37,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:14:37,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:37,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-15 00:14:37,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:37,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:37,485 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:37,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:14:37,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:37,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:37,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:37,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:37,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:37,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:37,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:37,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:37,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:37,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:37,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:37,518 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:37,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-15 00:14:37,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:37,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:37,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:14:37,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:37,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:37,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:37,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:14:37,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:14:37,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:37,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-15 00:14:37,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:37,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:37,564 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:37,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 00:14:37,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:37,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:37,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:14:37,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:37,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:37,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:37,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:14:37,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:14:37,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:37,604 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-10-15 00:14:37,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:37,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:37,606 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:37,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:37,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:14:37,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:37,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:14:37,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:37,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:37,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:37,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:14:37,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:14:37,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:14:37,640 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:14:37,640 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:14:37,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:37,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:37,643 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:37,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 00:14:37,645 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:14:37,645 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:14:37,646 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:14:37,646 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1 + 21 Supporting invariants [] [2024-10-15 00:14:37,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:37,696 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-10-15 00:14:37,705 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:14:37,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:14:37,707 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x1~0!base,]]] [2024-10-15 00:14:37,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:37,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:14:37,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:37,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:14:37,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-15 00:14:37,870 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:14:37,872 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:37,911 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 48 states and 51 transitions. Complement of second has 6 states. [2024-10-15 00:14:37,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:14:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-10-15 00:14:37,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 23 letters. [2024-10-15 00:14:37,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:37,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 25 letters. Loop has 23 letters. [2024-10-15 00:14:37,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:37,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 46 letters. [2024-10-15 00:14:37,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:37,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions. [2024-10-15 00:14:37,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:14:37,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 50 transitions. [2024-10-15 00:14:37,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-15 00:14:37,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-15 00:14:37,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions. [2024-10-15 00:14:37,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:14:37,922 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-10-15 00:14:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions. [2024-10-15 00:14:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2024-10-15 00:14:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 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-10-15 00:14:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-10-15 00:14:37,923 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-10-15 00:14:37,923 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-10-15 00:14:37,924 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:14:37,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2024-10-15 00:14:37,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:14:37,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:14:37,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:14:37,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-15 00:14:37,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:14:37,926 INFO L745 eck$LassoCheckResult]: Stem: 499#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 500#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 491#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 493#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 495#L554-3 [2024-10-15 00:14:37,926 INFO L747 eck$LassoCheckResult]: Loop: 495#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 496#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 495#L554-3 [2024-10-15 00:14:37,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:37,927 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-10-15 00:14:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:37,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854437899] [2024-10-15 00:14:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:37,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:37,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:37,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:37,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2024-10-15 00:14:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:37,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516136960] [2024-10-15 00:14:37,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:37,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:37,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:37,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:37,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2024-10-15 00:14:37,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:37,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734090788] [2024-10-15 00:14:37,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:37,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:37,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:37,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:38,187 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:14:38,188 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:14:38,188 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:14:38,188 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:14:38,188 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:14:38,188 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:38,188 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:14:38,188 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:14:38,188 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration6_Lasso [2024-10-15 00:14:38,188 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:14:38,188 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:14:38,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:38,437 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:14:38,437 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:14:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:38,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:38,439 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:38,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 00:14:38,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:38,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:38,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:14:38,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:38,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:38,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:38,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:14:38,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:14:38,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:38,489 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-10-15 00:14:38,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:38,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:38,491 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-10-15 00:14:38,495 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-10-15 00:14:38,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:38,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:38,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:14:38,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:38,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:38,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:38,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:14:38,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:14:38,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:38,544 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-10-15 00:14:38,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:38,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:38,546 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-10-15 00:14:38,550 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-10-15 00:14:38,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:38,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:38,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:38,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:38,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:38,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:38,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:38,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:38,600 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-10-15 00:14:38,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:38,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:38,602 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:38,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-15 00:14:38,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:38,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:38,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:38,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:38,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:38,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:38,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:38,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:14:38,649 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-15 00:14:38,649 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-15 00:14:38,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:38,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:38,656 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:38,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:14:38,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-15 00:14:38,680 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:14:38,681 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:14:38,681 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2 Supporting invariants [] [2024-10-15 00:14:38,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-15 00:14:38,719 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:14:38,720 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 00:14:38,724 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 00:14:38,724 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-10-15 00:14:38,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:38,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:14:38,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:38,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:14:38,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:38,787 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:14:38,790 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:38,812 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 73 states and 79 transitions. Complement of second has 7 states. [2024-10-15 00:14:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:14:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-15 00:14:38,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-15 00:14:38,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:38,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-15 00:14:38,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:38,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-15 00:14:38,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:38,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions. [2024-10-15 00:14:38,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:14:38,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 55 states and 59 transitions. [2024-10-15 00:14:38,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-15 00:14:38,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-15 00:14:38,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2024-10-15 00:14:38,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:14:38,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-10-15 00:14:38,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2024-10-15 00:14:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-10-15 00:14:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-10-15 00:14:38,825 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-15 00:14:38,825 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-15 00:14:38,825 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:14:38,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions. [2024-10-15 00:14:38,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:14:38,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:14:38,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:14:38,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1, 1] [2024-10-15 00:14:38,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:14:38,830 INFO L745 eck$LassoCheckResult]: Stem: 667#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 668#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 658#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 659#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 707#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 706#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 705#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 703#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 701#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 699#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 697#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 695#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 693#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 691#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 689#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 687#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 685#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 683#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 681#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 679#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 677#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 676#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 675#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 671#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 670#L554-4 call main_#t~mem9#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 660#L552-3 call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 662#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#1(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 663#L554-3 [2024-10-15 00:14:38,830 INFO L747 eck$LassoCheckResult]: Loop: 663#L554-3 call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 664#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 663#L554-3 [2024-10-15 00:14:38,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:38,830 INFO L85 PathProgramCache]: Analyzing trace with hash 423138919, now seen corresponding path program 2 times [2024-10-15 00:14:38,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:38,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645414780] [2024-10-15 00:14:38,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:38,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:38,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:38,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:38,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:38,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 2 times [2024-10-15 00:14:38,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:38,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334676605] [2024-10-15 00:14:38,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:38,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:38,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:38,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1385391412, now seen corresponding path program 3 times [2024-10-15 00:14:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:38,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614062498] [2024-10-15 00:14:38,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:38,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:38,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:39,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:39,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:44,542 WARN L286 SmtUtils]: Spent 5.47s on a formula simplification. DAG size of input: 189 DAG size of output: 165 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-15 00:14:44,637 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:14:44,638 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:14:44,638 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:14:44,638 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:14:44,638 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:14:44,638 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:44,638 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:14:44,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:14:44,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration7_Lasso [2024-10-15 00:14:44,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:14:44,638 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:14:44,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:44,903 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:14:44,903 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:14:44,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:44,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:44,906 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:44,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-15 00:14:44,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:44,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:44,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:14:44,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:44,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:44,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:44,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:14:44,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:14:44,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:44,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:44,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:44,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:44,934 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:44,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-15 00:14:44,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:44,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:44,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:44,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:44,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:44,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:44,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:44,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:44,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-15 00:14:44,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:44,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:44,978 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:44,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-15 00:14:44,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:44,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:44,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:44,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:44,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:44,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:44,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:45,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:45,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:45,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:45,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:45,012 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:45,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-15 00:14:45,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:14:45,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:45,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:45,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:45,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:45,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:45,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:45,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:14:45,045 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-15 00:14:45,045 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-10-15 00:14:45,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:45,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:45,048 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:14:45,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-15 00:14:45,050 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:14:45,061 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:14:45,061 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:14:45,061 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3 Supporting invariants [] [2024-10-15 00:14:45,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:45,081 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:14:45,084 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 00:14:45,085 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 00:14:45,085 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-10-15 00:14:45,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:45,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:14:45,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:45,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:14:45,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:45,166 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:14:45,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:45,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 73 transitions. Complement of second has 7 states. [2024-10-15 00:14:45,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:14:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-15 00:14:45,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-10-15 00:14:45,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:45,190 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:14:45,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:45,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:14:45,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:45,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:14:45,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:45,304 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:14:45,305 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:45,323 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 73 transitions. Complement of second has 7 states. [2024-10-15 00:14:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:14:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-15 00:14:45,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-10-15 00:14:45,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:45,325 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:14:45,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:45,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:14:45,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:45,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:14:45,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:45,404 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:14:45,404 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:45,419 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 82 transitions. Complement of second has 6 states. [2024-10-15 00:14:45,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:14:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:14:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-15 00:14:45,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 27 letters. Loop has 2 letters. [2024-10-15 00:14:45,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:45,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 29 letters. Loop has 2 letters. [2024-10-15 00:14:45,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:45,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 27 letters. Loop has 4 letters. [2024-10-15 00:14:45,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:45,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions. [2024-10-15 00:14:45,422 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:14:45,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2024-10-15 00:14:45,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:14:45,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:14:45,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:14:45,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:14:45,423 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:14:45,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:14:45,423 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:14:45,423 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:14:45,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:14:45,423 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:14:45,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:14:45,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:14:45 BoogieIcfgContainer [2024-10-15 00:14:45,430 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:14:45,431 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:14:45,431 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:14:45,431 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:14:45,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:14:32" (3/4) ... [2024-10-15 00:14:45,432 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:14:45,433 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:14:45,433 INFO L158 Benchmark]: Toolchain (without parser) took 14199.61ms. Allocated memory was 167.8MB in the beginning and 291.5MB in the end (delta: 123.7MB). Free memory was 95.3MB in the beginning and 89.7MB in the end (delta: 5.5MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2024-10-15 00:14:45,433 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:14:45,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.96ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 94.9MB in the beginning and 207.7MB in the end (delta: -112.7MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-10-15 00:14:45,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.21ms. Allocated memory is still 241.2MB. Free memory was 207.7MB in the beginning and 206.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:14:45,463 INFO L158 Benchmark]: Boogie Preprocessor took 52.57ms. Allocated memory is still 241.2MB. Free memory was 206.6MB in the beginning and 204.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:14:45,464 INFO L158 Benchmark]: RCFGBuilder took 275.12ms. Allocated memory is still 241.2MB. Free memory was 204.5MB in the beginning and 191.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 00:14:45,464 INFO L158 Benchmark]: BuchiAutomizer took 13282.23ms. Allocated memory was 241.2MB in the beginning and 291.5MB in the end (delta: 50.3MB). Free memory was 191.9MB in the beginning and 89.7MB in the end (delta: 102.2MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. [2024-10-15 00:14:45,464 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 291.5MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:14:45,465 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.11ms. Allocated memory is still 167.8MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.96ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 94.9MB in the beginning and 207.7MB in the end (delta: -112.7MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.21ms. Allocated memory is still 241.2MB. Free memory was 207.7MB in the beginning and 206.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.57ms. Allocated memory is still 241.2MB. Free memory was 206.6MB in the beginning and 204.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 275.12ms. Allocated memory is still 241.2MB. Free memory was 204.5MB in the beginning and 191.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 13282.23ms. Allocated memory was 241.2MB in the beginning and 291.5MB in the end (delta: 50.3MB). Free memory was 191.9MB in the beginning and 89.7MB in the end (delta: 102.2MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 291.5MB. Free memory is still 89.7MB. 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: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x1~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.2s and 8 iterations. TraceHistogramMax:10. Analysis of lassos took 12.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 90/90 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 130 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 63 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital149 mio100 ax112 hnf100 lsp87 ukn62 mio100 lsp26 div100 bol100 ite100 ukn100 eq163 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms 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 [2024-10-15 00:14:45,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 RESULT: Ultimate proved your program to be correct! [2024-10-15 00:14:45,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 00:14:45,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:45,907 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