./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/c.08-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:18:45,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:18:45,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:18:45,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:18:45,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:18:45,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:18:45,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:18:45,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:18:45,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:18:45,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:18:45,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:18:45,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:18:45,590 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:18:45,590 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:18:45,592 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:18:45,592 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:18:45,592 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:18:45,592 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:18:45,593 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:18:45,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:18:45,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:18:45,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:18:45,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:18:45,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:18:45,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:18:45,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:18:45,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:18:45,598 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:18:45,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:18:45,598 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:18:45,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:18:45,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:18:45,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:18:45,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:18:45,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:18:45,600 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:18:45,600 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-clean/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-clean/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 -> 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 [2024-10-12 00:18:45,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:18:45,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:18:45,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:18:45,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:18:45,896 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:18:45,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2024-10-12 00:18:47,413 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:18:47,643 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:18:47,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2024-10-12 00:18:47,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a017f086f/c4a109d4f7294fecafd8e62b4b5435df/FLAG308a275de [2024-10-12 00:18:47,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a017f086f/c4a109d4f7294fecafd8e62b4b5435df [2024-10-12 00:18:47,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:18:47,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:18:47,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:18:47,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:18:47,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:18:47,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:18:47" (1/1) ... [2024-10-12 00:18:47,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a63be25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:47, skipping insertion in model container [2024-10-12 00:18:47,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:18:47" (1/1) ... [2024-10-12 00:18:47,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:18:48,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:18:48,117 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:18:48,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:18:48,190 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:18:48,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48 WrapperNode [2024-10-12 00:18:48,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:18:48,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:18:48,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:18:48,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:18:48,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,226 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-10-12 00:18:48,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:18:48,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:18:48,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:18:48,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:18:48,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,252 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [5, 5, 2]. 42 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [2, 3, 1]. [2024-10-12 00:18:48,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,263 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:18:48,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:18:48,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:18:48,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:18:48,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (1/1) ... [2024-10-12 00:18:48,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:48,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:48,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:48,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:18:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:18:48,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:18:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 00:18:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:18:48,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:18:48,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 00:18:48,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:18:48,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:18:48,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:18:48,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:18:48,492 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:18:48,494 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:18:48,624 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-12 00:18:48,624 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:18:48,635 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:18:48,635 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:18:48,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:18:48 BoogieIcfgContainer [2024-10-12 00:18:48,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:18:48,637 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:18:48,637 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:18:48,640 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:18:48,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:18:48,640 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:18:47" (1/3) ... [2024-10-12 00:18:48,641 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f765c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:18:48, skipping insertion in model container [2024-10-12 00:18:48,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:18:48,641 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:48" (2/3) ... [2024-10-12 00:18:48,641 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f765c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:18:48, skipping insertion in model container [2024-10-12 00:18:48,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:18:48,642 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:18:48" (3/3) ... [2024-10-12 00:18:48,642 INFO L332 chiAutomizerObserver]: Analyzing ICFG c.08-alloca.i [2024-10-12 00:18:48,682 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:18:48,682 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:18:48,682 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:18:48,682 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:18:48,683 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:18:48,683 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:18:48,683 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:18:48,683 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:18:48,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-12 00:18:48,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:18:48,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:48,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:48,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:18:48,707 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:18:48,707 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:18:48,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-12 00:18:48,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:18:48,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:48,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:48,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:18:48,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:18:48,715 INFO L745 eck$LassoCheckResult]: Stem: 5#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 3#L555-3true [2024-10-12 00:18:48,715 INFO L747 eck$LassoCheckResult]: Loop: 3#L555-3true call test_fun_#t~mem5#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 10#L555-1true assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 8#L557-3true assume !true; 12#L557-4true call test_fun_#t~mem9#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 3#L555-3true [2024-10-12 00:18:48,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:48,720 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:18:48,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:48,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694035045] [2024-10-12 00:18:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:48,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:48,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:48,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:48,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2024-10-12 00:18:48,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:48,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823083731] [2024-10-12 00:18:48,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:48,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:48,976 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-12 00:18:48,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:48,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823083731] [2024-10-12 00:18:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823083731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:18:48,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:18:48,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:18:48,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233933504] [2024-10-12 00:18:48,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:18:48,983 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:18:48,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:49,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 00:18:49,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 00:18:49,023 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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) 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-12 00:18:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:49,030 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2024-10-12 00:18:49,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2024-10-12 00:18:49,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:18:49,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2024-10-12 00:18:49,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-12 00:18:49,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-12 00:18:49,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2024-10-12 00:18:49,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:18:49,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-12 00:18:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2024-10-12 00:18:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-10-12 00:18:49,064 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-12 00:18:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-10-12 00:18:49,066 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-12 00:18:49,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:18:49,071 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-12 00:18:49,072 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:18:49,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2024-10-12 00:18:49,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:18:49,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:49,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:49,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:18:49,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:18:49,075 INFO L745 eck$LassoCheckResult]: Stem: 34#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 32#L555-3 [2024-10-12 00:18:49,075 INFO L747 eck$LassoCheckResult]: Loop: 32#L555-3 call test_fun_#t~mem5#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 33#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 36#L557-3 call test_fun_#t~mem7#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 37#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 38#L557-4 call test_fun_#t~mem9#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 32#L555-3 [2024-10-12 00:18:49,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:49,078 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:18:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:49,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528187565] [2024-10-12 00:18:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:49,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:49,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:49,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:49,177 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2024-10-12 00:18:49,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:49,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729492276] [2024-10-12 00:18:49,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:49,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:49,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:49,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:49,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2024-10-12 00:18:49,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:49,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360123608] [2024-10-12 00:18:49,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:49,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:49,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:49,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:50,041 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:50,042 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:50,043 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:50,043 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:50,043 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:50,043 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:50,043 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:50,043 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:50,043 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration2_Lasso [2024-10-12 00:18:50,044 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:50,044 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:50,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,961 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:50,964 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:50,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:50,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:50,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:50,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:18:50,970 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-12 00:18:50,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:50,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:50,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:50,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:50,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:50,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:50,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:50,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:51,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:18:51,018 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-12 00:18:51,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:18:51,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,053 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:18:51,056 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-12 00:18:51,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:51,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,090 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:18:51,093 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-12 00:18:51,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:51,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:18:51,126 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-12 00:18:51,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:51,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,152 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:18:51,154 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-12 00:18:51,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:18:51,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:18:51,187 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-12 00:18:51,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:18:51,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,229 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:18:51,231 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-12 00:18:51,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:51,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,262 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:18:51,263 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-12 00:18:51,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,280 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:18:51,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,298 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,302 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-12 00:18:51,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:18:51,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:18:51,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,347 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:18:51,349 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-12 00:18:51,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:18:51,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,377 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:18:51,378 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-12 00:18:51,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:51,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,416 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:18:51,419 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-12 00:18:51,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:18:51,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,456 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:18:51,459 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-12 00:18:51,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:18:51,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,496 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:18:51,500 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-12 00:18:51,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:51,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,537 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:18:51,539 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-12 00:18:51,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:51,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,580 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:18:51,583 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-12 00:18:51,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:51,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,630 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:18:51,632 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-12 00:18:51,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,657 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:51,679 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-12 00:18:51,679 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-12 00:18:51,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,691 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:18:51,699 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:51,714 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:51,714 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:51,715 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~i_ref~0#1.base) 0)_1) = 2*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~i_ref~0#1.base) 0)_1 + 1 Supporting invariants [] [2024-10-12 00:18:51,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:18:51,809 INFO L156 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2024-10-12 00:18:51,822 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:51,826 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:51,826 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] [2024-10-12 00:18:51,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:51,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 00:18:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:51,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:18:51,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:51,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:18:51,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:52,036 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-12 00:18:52,042 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-12 00:18:52,044 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-12 00:18:52,130 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 12 states and 15 transitions. Complement of second has 6 states. [2024-10-12 00:18:52,131 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-12 00:18:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-12 00:18:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-10-12 00:18:52,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2024-10-12 00:18:52,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:52,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2024-10-12 00:18:52,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:52,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2024-10-12 00:18:52,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:52,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2024-10-12 00:18:52,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:52,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 14 transitions. [2024-10-12 00:18:52,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-12 00:18:52,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-12 00:18:52,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2024-10-12 00:18:52,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:52,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-12 00:18:52,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2024-10-12 00:18:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-12 00:18:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) 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-12 00:18:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-10-12 00:18:52,141 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-12 00:18:52,141 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-12 00:18:52,141 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:18:52,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-10-12 00:18:52,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:52,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:52,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:52,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:18:52,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:52,143 INFO L745 eck$LassoCheckResult]: Stem: 192#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 188#L555-3 call test_fun_#t~mem5#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 190#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 194#L557-3 [2024-10-12 00:18:52,143 INFO L747 eck$LassoCheckResult]: Loop: 194#L557-3 call test_fun_#t~mem7#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 195#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 194#L557-3 [2024-10-12 00:18:52,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-10-12 00:18:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:52,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746361820] [2024-10-12 00:18:52,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:52,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:52,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:52,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:52,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:52,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2024-10-12 00:18:52,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:52,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33816577] [2024-10-12 00:18:52,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:52,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:52,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:52,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:52,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2024-10-12 00:18:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:52,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811695317] [2024-10-12 00:18:52,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:52,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:52,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:52,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:52,958 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:52,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:52,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:52,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:52,959 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:52,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:52,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:52,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:52,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration3_Lasso [2024-10-12 00:18:52,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:52,959 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:52,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:52,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:52,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:52,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:53,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:53,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:53,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:53,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:53,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:53,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:53,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:53,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:53,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:53,694 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:53,694 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:53,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:53,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:53,696 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:53,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:18:53,702 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-12 00:18:53,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:53,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:53,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:53,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:53,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:53,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:53,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:53,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:53,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-12 00:18:53,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:53,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:53,737 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:53,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:18:53,738 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-12 00:18:53,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:53,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:53,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:53,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:53,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:53,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:53,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:53,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:53,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:53,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:53,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:53,764 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:53,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:18:53,766 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-12 00:18:53,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:53,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:53,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:53,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:53,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:53,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:53,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:53,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:53,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:53,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:53,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:53,790 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:53,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:18:53,792 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-12 00:18:53,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:53,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:53,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:53,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:53,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:53,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:53,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:53,827 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-12 00:18:53,828 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-12 00:18:53,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:53,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:53,830 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:53,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:18:53,835 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:53,849 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:53,849 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:53,849 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2, v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2) = -1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2 Supporting invariants [] [2024-10-12 00:18:53,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:18:53,914 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2024-10-12 00:18:53,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:53,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:53,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] [2024-10-12 00:18:53,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 00:18:53,917 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 00:18:53,917 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] [2024-10-12 00:18:53,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:53,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:18:53,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:53,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:18:53,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:53,993 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-12 00:18:53,994 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-12 00:18:53,994 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 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-12 00:18:54,023 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 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 28 states and 34 transitions. Complement of second has 7 states. [2024-10-12 00:18:54,024 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-12 00:18:54,025 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-12 00:18:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:54,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:18:54,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:54,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-12 00:18:54,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:54,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-12 00:18:54,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:54,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2024-10-12 00:18:54,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:54,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 23 transitions. [2024-10-12 00:18:54,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-12 00:18:54,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-12 00:18:54,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2024-10-12 00:18:54,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:54,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-12 00:18:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2024-10-12 00:18:54,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2024-10-12 00:18:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-12 00:18:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-10-12 00:18:54,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-10-12 00:18:54,032 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-10-12 00:18:54,032 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:18:54,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2024-10-12 00:18:54,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:54,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:54,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:54,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-10-12 00:18:54,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:54,033 INFO L745 eck$LassoCheckResult]: Stem: 357#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 358#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 352#L555-3 call test_fun_#t~mem5#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 353#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 364#L557-3 call test_fun_#t~mem7#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 366#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 365#L557-4 call test_fun_#t~mem9#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 354#L555-3 call test_fun_#t~mem5#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 356#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 359#L557-3 [2024-10-12 00:18:54,033 INFO L747 eck$LassoCheckResult]: Loop: 359#L557-3 call test_fun_#t~mem7#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 360#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 359#L557-3 [2024-10-12 00:18:54,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:54,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1271569044, now seen corresponding path program 2 times [2024-10-12 00:18:54,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:54,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370463809] [2024-10-12 00:18:54,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:54,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:54,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:54,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370463809] [2024-10-12 00:18:54,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370463809] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:54,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220146353] [2024-10-12 00:18:54,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:18:54,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:54,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:54,291 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:54,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-12 00:18:54,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:54,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:18:54,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:54,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:18:54,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:54,424 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 11 treesize of output 7 [2024-10-12 00:18:54,460 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-12 00:18:54,467 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 17 treesize of output 9 [2024-10-12 00:18:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:54,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 00:18:54,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220146353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:18:54,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 00:18:54,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2024-10-12 00:18:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041152076] [2024-10-12 00:18:54,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:18:54,470 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:54,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:54,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 2 times [2024-10-12 00:18:54,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:54,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040205190] [2024-10-12 00:18:54,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:54,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:54,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:18:54,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-12 00:18:54,538 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 6 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:54,610 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-10-12 00:18:54,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2024-10-12 00:18:54,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:54,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 24 transitions. [2024-10-12 00:18:54,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:18:54,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:18:54,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2024-10-12 00:18:54,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:54,612 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-12 00:18:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2024-10-12 00:18:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-10-12 00:18:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-12 00:18:54,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-12 00:18:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:18:54,615 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-12 00:18:54,615 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:18:54,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-10-12 00:18:54,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:54,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:54,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:54,617 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-10-12 00:18:54,617 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:54,617 INFO L745 eck$LassoCheckResult]: Stem: 442#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 437#L555-3 call test_fun_#t~mem5#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 438#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 446#L557-3 call test_fun_#t~mem7#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 447#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 454#L557-3 call test_fun_#t~mem7#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 452#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 451#L557-4 call test_fun_#t~mem9#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 439#L555-3 call test_fun_#t~mem5#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 441#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 444#L557-3 [2024-10-12 00:18:54,617 INFO L747 eck$LassoCheckResult]: Loop: 444#L557-3 call test_fun_#t~mem7#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 445#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 444#L557-3 [2024-10-12 00:18:54,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2038480497, now seen corresponding path program 1 times [2024-10-12 00:18:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981499928] [2024-10-12 00:18:54,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:54,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:54,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 3 times [2024-10-12 00:18:54,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:54,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871962398] [2024-10-12 00:18:54,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:54,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:54,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash -474670092, now seen corresponding path program 2 times [2024-10-12 00:18:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:54,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553070812] [2024-10-12 00:18:54,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:54,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:55,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:55,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553070812] [2024-10-12 00:18:55,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553070812] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:55,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802396046] [2024-10-12 00:18:55,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:18:55,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:55,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:55,042 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:55,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-12 00:18:55,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:18:55,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:55,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 00:18:55,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:55,133 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 11 treesize of output 7 [2024-10-12 00:18:55,144 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 19 treesize of output 11 [2024-10-12 00:18:55,208 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-12 00:18:55,242 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 19 treesize of output 11 [2024-10-12 00:18:55,252 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-12 00:18:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:55,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:55,356 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 19 treesize of output 11 [2024-10-12 00:18:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802396046] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:55,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:55,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2024-10-12 00:18:55,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087077499] [2024-10-12 00:18:55,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:55,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:55,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 00:18:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-10-12 00:18:55,427 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:55,535 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-10-12 00:18:55,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2024-10-12 00:18:55,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:55,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 27 states and 30 transitions. [2024-10-12 00:18:55,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:55,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:18:55,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 30 transitions. [2024-10-12 00:18:55,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:55,537 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-10-12 00:18:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 30 transitions. [2024-10-12 00:18:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2024-10-12 00:18:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-12 00:18:55,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-12 00:18:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:18:55,540 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-12 00:18:55,540 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:18:55,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2024-10-12 00:18:55,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:55,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:55,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:55,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:18:55,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:55,541 INFO L745 eck$LassoCheckResult]: Stem: 600#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 601#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 595#L555-3 call test_fun_#t~mem5#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 596#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 604#L557-3 call test_fun_#t~mem7#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 605#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 606#L557-3 call test_fun_#t~mem7#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 613#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 612#L557-3 call test_fun_#t~mem7#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 608#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 607#L557-4 call test_fun_#t~mem9#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 597#L555-3 call test_fun_#t~mem5#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 599#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 602#L557-3 [2024-10-12 00:18:55,541 INFO L747 eck$LassoCheckResult]: Loop: 602#L557-3 call test_fun_#t~mem7#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 603#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 602#L557-3 [2024-10-12 00:18:55,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash -425323062, now seen corresponding path program 3 times [2024-10-12 00:18:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:55,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2698968] [2024-10-12 00:18:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:55,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:55,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:55,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:55,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:55,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 4 times [2024-10-12 00:18:55,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:55,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39561076] [2024-10-12 00:18:55,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:55,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:55,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:55,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:55,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -713568913, now seen corresponding path program 4 times [2024-10-12 00:18:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:55,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701411492] [2024-10-12 00:18:55,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:55,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:55,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:57,051 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:57,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:57,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:57,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:57,051 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:57,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:57,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:57,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:57,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration6_Lasso [2024-10-12 00:18:57,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:57,051 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:57,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:57,770 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:57,770 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:57,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:57,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:57,774 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:57,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:18:57,776 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-12 00:18:57,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:57,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:57,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:57,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:57,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:57,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:57,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:57,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:57,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:18:57,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:57,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:57,806 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:57,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:18:57,807 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-12 00:18:57,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:57,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:57,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:57,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:57,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:57,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:57,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:57,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:57,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-12 00:18:57,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:57,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:57,834 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:57,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:18:57,837 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-12 00:18:57,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:57,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:57,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:57,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:57,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:57,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:57,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:57,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:57,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:57,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:57,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:57,871 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:57,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:18:57,872 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-12 00:18:57,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:57,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:57,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:57,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:57,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:57,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:57,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:57,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:57,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:57,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:57,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:57,898 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:57,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:18:57,900 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-12 00:18:57,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:57,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:57,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:57,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:57,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:57,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:57,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:57,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:57,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:57,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:57,946 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:57,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:18:57,948 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-12 00:18:57,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:57,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:57,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:57,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:57,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:57,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:57,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:57,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:57,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-12 00:18:57,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:57,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:57,974 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:57,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:18:57,975 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-12 00:18:57,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:57,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:57,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:57,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:57,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:57,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:57,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:58,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:58,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:58,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:58,007 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:58,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:18:58,009 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-12 00:18:58,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:58,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:58,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:58,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:58,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:58,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:58,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:58,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:18:58,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:58,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:58,035 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:58,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:18:58,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:58,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:58,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:58,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:58,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:58,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:58,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:58,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:58,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-12 00:18:58,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:58,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:58,065 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:58,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:18:58,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:58,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:58,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:58,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:58,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:58,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:58,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:58,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:58,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:58,100 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:58,104 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-12 00:18:58,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:18:58,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:58,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:58,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:58,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:58,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:58,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:58,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:58,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:58,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:58,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:58,140 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:58,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:18:58,143 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-12 00:18:58,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:58,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:58,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:58,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:58,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:58,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:58,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:58,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:58,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:58,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:58,183 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:58,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-12 00:18:58,186 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-12 00:18:58,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:58,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:58,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:58,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:58,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:58,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:58,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:58,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:58,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:58,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:58,224 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:58,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:18:58,226 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-12 00:18:58,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:58,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:58,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:58,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:58,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:58,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:58,248 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:58,262 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-12 00:18:58,263 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-12 00:18:58,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:58,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:58,265 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:58,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:18:58,267 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:58,278 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:58,278 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:58,278 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~j_ref~0#1.base) 0)_2, v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_3) = -1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~j_ref~0#1.base) 0)_2 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_3 Supporting invariants [] [2024-10-12 00:18:58,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-12 00:18:58,326 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2024-10-12 00:18:58,328 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:58,328 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:58,329 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] [2024-10-12 00:18:58,329 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 00:18:58,329 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 00:18:58,329 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] [2024-10-12 00:18:58,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:58,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:18:58,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:58,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:18:58,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:58,443 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-12 00:18:58,443 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-12 00:18:58,443 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-12 00:18:58,492 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 33 states and 38 transitions. Complement of second has 8 states. [2024-10-12 00:18:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-12 00:18:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2024-10-12 00:18:58,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 13 letters. Loop has 2 letters. [2024-10-12 00:18:58,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:58,494 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:58,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:18:58,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:58,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:18:58,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:58,608 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-12 00:18:58,609 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-12 00:18:58,609 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-12 00:18:58,657 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 33 states and 38 transitions. Complement of second has 8 states. [2024-10-12 00:18:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-12 00:18:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2024-10-12 00:18:58,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 13 letters. Loop has 2 letters. [2024-10-12 00:18:58,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:58,659 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:58,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:58,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:18:58,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:58,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:18:58,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:58,774 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-12 00:18:58,775 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-12 00:18:58,775 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-12 00:18:58,814 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 34 states and 40 transitions. Complement of second has 7 states. [2024-10-12 00:18:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-12 00:18:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2024-10-12 00:18:58,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 2 letters. [2024-10-12 00:18:58,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:58,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 15 letters. Loop has 2 letters. [2024-10-12 00:18:58,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:58,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 4 letters. [2024-10-12 00:18:58,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:58,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2024-10-12 00:18:58,818 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:18:58,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2024-10-12 00:18:58,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:18:58,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:18:58,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:18:58,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:18:58,819 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:18:58,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:18:58,819 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:18:58,819 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:18:58,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:18:58,819 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:18:58,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:18:58,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:18:58 BoogieIcfgContainer [2024-10-12 00:18:58,825 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:18:58,826 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:18:58,826 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:18:58,826 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:18:58,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:18:48" (3/4) ... [2024-10-12 00:18:58,827 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:18:58,828 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:18:58,829 INFO L158 Benchmark]: Toolchain (without parser) took 11151.40ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 93.8MB in the beginning and 71.3MB in the end (delta: 22.5MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2024-10-12 00:18:58,829 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 104.9MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:18:58,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.42ms. Allocated memory is still 161.5MB. Free memory was 93.6MB in the beginning and 125.1MB in the end (delta: -31.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-10-12 00:18:58,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.59ms. Allocated memory is still 161.5MB. Free memory was 125.1MB in the beginning and 123.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:18:58,830 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 161.5MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:18:58,830 INFO L158 Benchmark]: RCFGBuilder took 363.52ms. Allocated memory is still 161.5MB. Free memory was 121.0MB in the beginning and 108.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:18:58,830 INFO L158 Benchmark]: BuchiAutomizer took 10188.44ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 107.7MB in the beginning and 72.3MB in the end (delta: 35.4MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2024-10-12 00:18:58,830 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 197.1MB. Free memory was 72.3MB in the beginning and 71.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:18:58,833 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.67ms. Allocated memory is still 104.9MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.42ms. Allocated memory is still 161.5MB. Free memory was 93.6MB in the beginning and 125.1MB in the end (delta: -31.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.59ms. Allocated memory is still 161.5MB. Free memory was 125.1MB in the beginning and 123.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 161.5MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 363.52ms. Allocated memory is still 161.5MB. Free memory was 121.0MB in the beginning and 108.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 10188.44ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 107.7MB in the beginning and 72.3MB in the end (delta: 35.4MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 197.1MB. Free memory was 72.3MB in the beginning and 71.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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[~i_ref~0!base,]]] - 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[~i_ref~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[~j_ref~0!base,]]] - 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[~i_ref~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[~j_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 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 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.1s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 8.8s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 39 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital207 mio100 ax108 hnf100 lsp92 ukn73 mio100 lsp24 div100 bol100 ite100 ukn100 eq168 hnf89 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 00:18:58,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:59,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:59,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:59,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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