./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/b.18-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/b.18-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 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:18:32,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:18:32,288 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:32,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:18:32,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:18:32,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:18:32,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:18:32,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:18:32,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:18:32,328 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:18:32,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:18:32,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:18:32,329 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:18:32,331 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:18:32,332 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:18:32,332 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:18:32,332 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:18:32,332 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:18:32,332 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:18:32,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:18:32,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:18:32,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:18:32,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:18:32,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:18:32,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:18:32,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:18:32,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:18:32,335 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:18:32,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:18:32,336 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:18:32,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:18:32,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:18:32,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:18:32,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:18:32,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:18:32,337 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:18:32,338 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 -> 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff [2024-10-12 00:18:32,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:18:32,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:18:32,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:18:32,641 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:18:32,642 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:18:32,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2024-10-12 00:18:34,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:18:34,368 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:18:34,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2024-10-12 00:18:34,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e4d0b4632/1fc8e1c43d50434bb9b35d0eb9d14012/FLAG191920298 [2024-10-12 00:18:34,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e4d0b4632/1fc8e1c43d50434bb9b35d0eb9d14012 [2024-10-12 00:18:34,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:18:34,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:18:34,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:18:34,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:18:34,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:18:34,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:18:34" (1/1) ... [2024-10-12 00:18:34,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddfa591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:34, skipping insertion in model container [2024-10-12 00:18:34,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:18:34" (1/1) ... [2024-10-12 00:18:34,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:18:35,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:18:35,029 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:18:35,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:18:35,113 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:18:35,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:35 WrapperNode [2024-10-12 00:18:35,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:18:35,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:18:35,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:18:35,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:18:35,123 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:35" (1/1) ... [2024-10-12 00:18:35,142 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:35" (1/1) ... [2024-10-12 00:18:35,159 INFO L138 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2024-10-12 00:18:35,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:18:35,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:18:35,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:18:35,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:18:35,171 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:35" (1/1) ... [2024-10-12 00:18:35,172 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:35" (1/1) ... [2024-10-12 00:18:35,174 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:35" (1/1) ... [2024-10-12 00:18:35,187 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [8, 8]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-10-12 00:18:35,188 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:35" (1/1) ... [2024-10-12 00:18:35,188 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:35" (1/1) ... [2024-10-12 00:18:35,193 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:35" (1/1) ... [2024-10-12 00:18:35,198 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:35" (1/1) ... [2024-10-12 00:18:35,199 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:35" (1/1) ... [2024-10-12 00:18:35,200 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:35" (1/1) ... [2024-10-12 00:18:35,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:18:35,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:18:35,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:18:35,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:18:35,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:35" (1/1) ... [2024-10-12 00:18:35,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:35,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:35,244 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:35,248 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:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:18:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:18:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:18:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:18:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:18:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:18:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:18:35,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:18:35,418 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:18:35,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:18:35,617 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-12 00:18:35,617 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:18:35,638 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:18:35,638 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 00:18:35,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:18:35 BoogieIcfgContainer [2024-10-12 00:18:35,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:18:35,639 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:18:35,639 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:18:35,643 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:18:35,644 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:18:35,644 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:18:34" (1/3) ... [2024-10-12 00:18:35,646 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d8c85dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:18:35, skipping insertion in model container [2024-10-12 00:18:35,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:18:35,647 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:35" (2/3) ... [2024-10-12 00:18:35,647 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d8c85dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:18:35, skipping insertion in model container [2024-10-12 00:18:35,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:18:35,647 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:18:35" (3/3) ... [2024-10-12 00:18:35,649 INFO L332 chiAutomizerObserver]: Analyzing ICFG b.18-alloca.i [2024-10-12 00:18:35,708 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:18:35,709 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:18:35,709 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:18:35,709 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:18:35,709 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:18:35,710 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:18:35,710 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:18:35,711 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:18:35,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:35,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:18:35,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:35,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:35,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:18:35,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:18:35,742 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:18:35,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:35,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:18:35,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:35,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:35,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:18:35,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:18:35,752 INFO L745 eck$LassoCheckResult]: Stem: 13#$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~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11#L559-4true [2024-10-12 00:18:35,753 INFO L747 eck$LassoCheckResult]: Loop: 11#L559-4true call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 8#L553-1true assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 4#L553-3true assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17#L554true assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 5#L559-3true assume !true; 11#L559-4true [2024-10-12 00:18:35,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:35,762 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:18:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:35,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020424272] [2024-10-12 00:18:35,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:35,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:35,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:35,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:35,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash 35410170, now seen corresponding path program 1 times [2024-10-12 00:18:35,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:35,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905110570] [2024-10-12 00:18:35,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:35,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:36,057 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:36,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:36,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905110570] [2024-10-12 00:18:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905110570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:18:36,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:18:36,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-12 00:18:36,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875337734] [2024-10-12 00:18:36,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:18:36,064 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:18:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:36,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 00:18:36,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 00:18:36,099 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:36,108 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2024-10-12 00:18:36,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2024-10-12 00:18:36,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:18:36,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 10 states and 14 transitions. [2024-10-12 00:18:36,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:36,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:18:36,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2024-10-12 00:18:36,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:18:36,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2024-10-12 00:18:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2024-10-12 00:18:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-12 00:18:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2024-10-12 00:18:36,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2024-10-12 00:18:36,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:18:36,156 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2024-10-12 00:18:36,159 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:18:36,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2024-10-12 00:18:36,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:18:36,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:36,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:36,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:18:36,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:18:36,161 INFO L745 eck$LassoCheckResult]: Stem: 48#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 49#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 50#L559-4 [2024-10-12 00:18:36,161 INFO L747 eck$LassoCheckResult]: Loop: 50#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 51#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 44#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 45#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 42#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 43#L555-1 assume !(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1; 50#L559-4 [2024-10-12 00:18:36,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:36,163 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:18:36,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:36,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082005281] [2024-10-12 00:18:36,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:36,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:36,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:36,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:36,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1097700202, now seen corresponding path program 1 times [2024-10-12 00:18:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144485001] [2024-10-12 00:18:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:36,509 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:36,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:36,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144485001] [2024-10-12 00:18:36,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144485001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:18:36,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:18:36,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:18:36,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491091142] [2024-10-12 00:18:36,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:18:36,511 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:18:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:36,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:18:36,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:18:36,512 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 5 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:36,578 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 00:18:36,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2024-10-12 00:18:36,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-12 00:18:36,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2024-10-12 00:18:36,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-12 00:18:36,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-12 00:18:36,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-10-12 00:18:36,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:18:36,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-12 00:18:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-10-12 00:18:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2024-10-12 00:18:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2024-10-12 00:18:36,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:18:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:18:36,588 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:18:36,588 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:18:36,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2024-10-12 00:18:36,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-10-12 00:18:36,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:36,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:36,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:18:36,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:18:36,590 INFO L745 eck$LassoCheckResult]: Stem: 83#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 84#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 85#L559-4 [2024-10-12 00:18:36,590 INFO L747 eck$LassoCheckResult]: Loop: 85#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 86#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 79#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 80#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 81#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 82#L559-1 assume !(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1; 85#L559-4 [2024-10-12 00:18:36,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:36,592 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:18:36,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:36,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237065925] [2024-10-12 00:18:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:36,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:36,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:36,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:36,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:36,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1097715097, now seen corresponding path program 1 times [2024-10-12 00:18:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573688021] [2024-10-12 00:18:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:36,782 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:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573688021] [2024-10-12 00:18:36,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573688021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:18:36,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:18:36,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:18:36,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421301819] [2024-10-12 00:18:36,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:18:36,784 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:18:36,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:36,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:18:36,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:18:36,784 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:36,845 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-10-12 00:18:36,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2024-10-12 00:18:36,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-12 00:18:36,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2024-10-12 00:18:36,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:18:36,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:18:36,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2024-10-12 00:18:36,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:18:36,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-12 00:18:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2024-10-12 00:18:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2024-10-12 00:18:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2024-10-12 00:18:36,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-10-12 00:18:36,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:18:36,857 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-10-12 00:18:36,857 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:18:36,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2024-10-12 00:18:36,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-12 00:18:36,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:36,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:36,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:18:36,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:36,858 INFO L745 eck$LassoCheckResult]: Stem: 122#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 125#L559-4 [2024-10-12 00:18:36,858 INFO L747 eck$LassoCheckResult]: Loop: 125#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 126#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 118#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 119#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 116#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 117#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 127#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 129#L555-1 assume !(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1; 125#L559-4 [2024-10-12 00:18:36,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-12 00:18:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:36,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32203013] [2024-10-12 00:18:36,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:36,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:36,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:36,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:36,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:36,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1672057937, now seen corresponding path program 1 times [2024-10-12 00:18:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:36,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658163462] [2024-10-12 00:18:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:37,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:37,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658163462] [2024-10-12 00:18:37,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658163462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:37,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116032913] [2024-10-12 00:18:37,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:37,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:37,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:37,129 INFO L229 MonitoredProcess]: Starting monitored process 2 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:37,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 00:18:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:37,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:37,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:37,343 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:37,391 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:37,406 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:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:37,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:37,498 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 21 treesize of output 13 [2024-10-12 00:18:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:37,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116032913] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:37,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:37,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-12 00:18:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589269015] [2024-10-12 00:18:37,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:37,511 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:18:37,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:37,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 00:18:37,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-12 00:18:37,513 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 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:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:37,681 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2024-10-12 00:18:37,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2024-10-12 00:18:37,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-12 00:18:37,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2024-10-12 00:18:37,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:18:37,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:18:37,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2024-10-12 00:18:37,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:18:37,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 00:18:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2024-10-12 00:18:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-10-12 00:18:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-12 00:18:37,705 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-12 00:18:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:18:37,707 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-12 00:18:37,707 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:18:37,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-10-12 00:18:37,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:18:37,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:37,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:37,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:18:37,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:37,708 INFO L745 eck$LassoCheckResult]: Stem: 217#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 220#L559-4 [2024-10-12 00:18:37,708 INFO L747 eck$LassoCheckResult]: Loop: 220#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 221#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 213#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 214#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 223#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 219#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 215#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 216#L559-1 assume !(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1; 220#L559-4 [2024-10-12 00:18:37,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-12 00:18:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:37,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541109990] [2024-10-12 00:18:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:37,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:37,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:37,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1657743362, now seen corresponding path program 1 times [2024-10-12 00:18:37,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:37,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266821118] [2024-10-12 00:18:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:37,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:37,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash -967181888, now seen corresponding path program 1 times [2024-10-12 00:18:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:37,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646582482] [2024-10-12 00:18:37,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:38,246 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:38,247 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:38,247 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:38,247 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:38,247 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:38,248 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:38,248 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:38,248 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:38,248 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration5_Lasso [2024-10-12 00:18:38,248 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:38,248 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:38,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:38,902 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:38,906 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:38,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:38,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:38,925 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:38,927 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:38,928 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:38,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:38,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:38,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:38,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:38,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:38,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:38,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:38,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:38,963 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:38,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:38,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:38,966 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:38,967 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:38,968 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:38,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:38,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:38,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:38,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:38,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:38,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:38,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:38,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:39,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:18:39,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:39,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:39,004 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:39,005 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:39,006 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:39,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:39,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:39,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:39,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:39,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:39,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:39,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:39,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:39,037 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:39,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:39,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:39,040 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:39,041 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:39,043 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:39,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:39,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:39,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:39,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:39,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:39,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:39,069 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:39,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:18:39,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:39,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:39,088 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:39,089 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:39,090 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:39,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:39,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:39,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:39,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:39,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:39,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:39,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:39,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:39,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:39,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:39,145 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:39,145 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:39,146 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:39,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:39,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:39,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:39,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:39,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:39,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:39,173 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:39,189 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-12 00:18:39,189 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-12 00:18:39,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:39,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:39,195 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:39,202 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:39,204 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:39,217 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:39,218 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:39,218 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1 Supporting invariants [] [2024-10-12 00:18:39,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:39,258 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-10-12 00:18:39,262 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 00:18:39,263 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 00:18:39,263 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-10-12 00:18:39,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:39,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:18:39,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:39,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:18:39,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:39,330 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:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:18:39,378 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-10-12 00:18:39,379 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:39,495 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 53 transitions. Complement of second has 10 states. [2024-10-12 00:18:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2024-10-12 00:18:39,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 8 letters. [2024-10-12 00:18:39,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:39,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 8 letters. [2024-10-12 00:18:39,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:39,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 16 letters. [2024-10-12 00:18:39,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:39,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2024-10-12 00:18:39,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-12 00:18:39,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 51 transitions. [2024-10-12 00:18:39,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-10-12 00:18:39,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-12 00:18:39,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2024-10-12 00:18:39,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:39,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-10-12 00:18:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2024-10-12 00:18:39,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2024-10-12 00:18:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-10-12 00:18:39,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-10-12 00:18:39,512 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-10-12 00:18:39,512 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:18:39,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2024-10-12 00:18:39,516 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-12 00:18:39,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:39,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:39,517 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:18:39,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1] [2024-10-12 00:18:39,517 INFO L745 eck$LassoCheckResult]: Stem: 386#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 387#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 394#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 392#L553-1 [2024-10-12 00:18:39,517 INFO L747 eck$LassoCheckResult]: Loop: 392#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 378#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 379#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 374#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 375#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 395#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 403#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 402#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 401#L555-1 assume !(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1; 388#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 392#L553-1 [2024-10-12 00:18:39,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-10-12 00:18:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:39,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145803787] [2024-10-12 00:18:39,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:39,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:39,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:39,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:39,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1479493138, now seen corresponding path program 2 times [2024-10-12 00:18:39,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:39,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980674494] [2024-10-12 00:18:39,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:39,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:39,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:39,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:39,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:39,581 INFO L85 PathProgramCache]: Analyzing trace with hash 376307409, now seen corresponding path program 1 times [2024-10-12 00:18:39,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:39,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443745030] [2024-10-12 00:18:39,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:39,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:39,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:39,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:40,144 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:40,145 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:40,145 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:40,145 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:40,145 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:40,145 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:40,145 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:40,145 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:40,145 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration6_Lasso [2024-10-12 00:18:40,145 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:40,145 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:40,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:18:40,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:40,734 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:40,734 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:40,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:40,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:40,736 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:40,738 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:40,739 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:40,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:40,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:40,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:40,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:40,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:40,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:40,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:40,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:40,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:40,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:40,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:40,764 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:40,765 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:40,765 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:40,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:40,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:40,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:40,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:40,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:40,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:40,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:40,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:40,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:40,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:40,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:40,790 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:40,791 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:40,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:40,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:40,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:40,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:40,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:40,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:40,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:40,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:40,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:40,815 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:40,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:40,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:40,817 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:40,818 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:40,818 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:40,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:40,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:40,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:40,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:40,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:40,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:40,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:40,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:40,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:18:40,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:40,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:40,842 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:40,844 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:40,845 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:40,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:40,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:40,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:40,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:40,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:40,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:40,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:40,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:40,874 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:40,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:40,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:40,877 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:40,878 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:40,879 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:40,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:40,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:40,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:40,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:40,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:40,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:40,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:40,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:40,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:40,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:40,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:40,912 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:40,913 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:40,914 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:40,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:40,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:40,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:40,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:40,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:40,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:40,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:40,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:40,936 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:40,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:40,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:40,938 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:40,940 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:40,940 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:40,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:40,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:40,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:40,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:40,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:40,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:40,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:40,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:40,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:18:40,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:40,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:40,964 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:40,965 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:40,966 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:40,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:40,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:40,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:40,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:40,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:40,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:40,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:40,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:40,988 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:40,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:40,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:40,989 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:40,991 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:40,991 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:41,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:41,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:41,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:41,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:41,016 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:41,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,018 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:41,019 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:41,019 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:41,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:41,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:41,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:41,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:41,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:41,041 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:41,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,043 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:41,044 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:41,045 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:41,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:41,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:41,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:41,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:41,078 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:41,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,079 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:41,081 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:41,081 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:41,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:41,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:41,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:41,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:41,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:18:41,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,121 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:41,123 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:41,123 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:41,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:41,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:41,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:41,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:41,152 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:41,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,154 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:41,154 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:41,155 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:41,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,165 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-12 00:18:41,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,170 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-12 00:18:41,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:41,177 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:41,195 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-12 00:18:41,195 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-12 00:18:41,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,198 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:41,199 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:41,199 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:41,212 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:41,213 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:41,213 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_2 Supporting invariants [] [2024-10-12 00:18:41,227 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:41,252 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-10-12 00:18:41,254 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:41,254 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:41,254 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-10-12 00:18:41,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:41,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:18:41,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:41,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:18:41,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:41,364 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:41,371 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:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:18:41,463 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2024-10-12 00:18:41,463 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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:41,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-12 00:18:41,658 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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 59 states and 83 transitions. Complement of second has 13 states. [2024-10-12 00:18:41,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2024-10-12 00:18:41,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 3 letters. Loop has 10 letters. [2024-10-12 00:18:41,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:41,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 13 letters. Loop has 10 letters. [2024-10-12 00:18:41,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:41,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 3 letters. Loop has 20 letters. [2024-10-12 00:18:41,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:41,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2024-10-12 00:18:41,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:18:41,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 50 states and 70 transitions. [2024-10-12 00:18:41,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:41,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:18:41,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 70 transitions. [2024-10-12 00:18:41,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:41,671 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 70 transitions. [2024-10-12 00:18:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 70 transitions. [2024-10-12 00:18:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-10-12 00:18:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 48 states have internal predecessors, (69), 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:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2024-10-12 00:18:41,678 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-10-12 00:18:41,678 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-10-12 00:18:41,681 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:18:41,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 69 transitions. [2024-10-12 00:18:41,682 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:18:41,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:41,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:41,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:41,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:41,683 INFO L745 eck$LassoCheckResult]: Stem: 601#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 602#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 609#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 610#L553-1 assume !test_fun_#t~short6#1; 619#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 617#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 615#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 614#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 612#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 598#L559-1 [2024-10-12 00:18:41,683 INFO L747 eck$LassoCheckResult]: Loop: 598#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 597#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 598#L559-1 [2024-10-12 00:18:41,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1272984874, now seen corresponding path program 1 times [2024-10-12 00:18:41,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:41,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824381716] [2024-10-12 00:18:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:41,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:18:41,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:41,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824381716] [2024-10-12 00:18:41,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824381716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:18:41,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:18:41,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:18:41,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405215414] [2024-10-12 00:18:41,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:18:41,721 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:41,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 1 times [2024-10-12 00:18:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353253806] [2024-10-12 00:18:41,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:41,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:41,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:41,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:41,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:18:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:18:41,770 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. cyclomatic complexity: 27 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:41,778 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2024-10-12 00:18:41,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 69 transitions. [2024-10-12 00:18:41,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:18:41,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 49 states and 63 transitions. [2024-10-12 00:18:41,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:41,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:41,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 63 transitions. [2024-10-12 00:18:41,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:41,782 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-10-12 00:18:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 63 transitions. [2024-10-12 00:18:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-12 00:18:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 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:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-10-12 00:18:41,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-10-12 00:18:41,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:18:41,788 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-10-12 00:18:41,789 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:18:41,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2024-10-12 00:18:41,790 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:18:41,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:41,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:41,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:41,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:41,792 INFO L745 eck$LassoCheckResult]: Stem: 708#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 715#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 716#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 702#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 703#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 721#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 719#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 720#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 699#L555-1 [2024-10-12 00:18:41,792 INFO L747 eck$LassoCheckResult]: Loop: 699#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 698#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 699#L555-1 [2024-10-12 00:18:41,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1215264812, now seen corresponding path program 1 times [2024-10-12 00:18:41,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:41,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562645998] [2024-10-12 00:18:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:41,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:41,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:41,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:41,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:41,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1948, now seen corresponding path program 1 times [2024-10-12 00:18:41,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:41,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455346384] [2024-10-12 00:18:41,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:41,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:41,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:41,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:41,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:41,821 INFO L85 PathProgramCache]: Analyzing trace with hash -361619193, now seen corresponding path program 2 times [2024-10-12 00:18:41,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:41,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684001686] [2024-10-12 00:18:41,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:41,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:41,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:41,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:42,271 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:42,271 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:42,271 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:42,271 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:42,271 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:42,271 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,271 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:42,271 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:42,271 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration8_Lasso [2024-10-12 00:18:42,272 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:42,272 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:42,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:42,680 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:42,681 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:42,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,683 INFO L229 MonitoredProcess]: Starting monitored process 26 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:42,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:18:42,688 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:42,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:42,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:42,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:42,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:42,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,723 INFO L229 MonitoredProcess]: Starting monitored process 27 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:42,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:18:42,725 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:42,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:42,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:42,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:42,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-12 00:18:42,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,749 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:42,750 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:42,751 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:42,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:42,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:42,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:42,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:42,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,781 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:42,782 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:42,783 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:42,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:42,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:42,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:42,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,812 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:42,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,814 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:42,817 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:42,817 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:42,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:42,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:42,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:42,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,846 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:42,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,848 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:42,849 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:42,850 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:42,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:42,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:42,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:42,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,872 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:42,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,874 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:42,875 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:42,876 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:42,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:42,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:42,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:42,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-12 00:18:42,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,899 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:42,900 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:42,901 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:42,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,936 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:42,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,938 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:42,939 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:42,939 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:42,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:18:42,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,967 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:42,969 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:42,969 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:42,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:42,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:42,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:42,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:42,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,995 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:42,996 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:42,997 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:43,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:43,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:43,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:43,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:43,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:43,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:43,016 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:43,024 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-12 00:18:43,025 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-12 00:18:43,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:43,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:43,026 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:43,027 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:43,028 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:43,039 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-12 00:18:43,039 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:43,039 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3 Supporting invariants [-1*ULTIMATE.start_test_fun_#t~mem9#1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3 >= 0] [2024-10-12 00:18:43,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:43,071 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2024-10-12 00:18:43,073 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:43,073 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:43,073 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-10-12 00:18:43,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:43,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:18:43,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:43,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:18:43,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:43,138 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 43 treesize of output 16 [2024-10-12 00:18:43,149 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:43,150 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:43,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 21 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:43,182 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 21. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 102 states and 128 transitions. Complement of second has 6 states. [2024-10-12 00:18:43,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-12 00:18:43,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2024-10-12 00:18:43,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:43,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2024-10-12 00:18:43,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:43,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-12 00:18:43,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:43,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 128 transitions. [2024-10-12 00:18:43,188 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-10-12 00:18:43,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 94 states and 119 transitions. [2024-10-12 00:18:43,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:18:43,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:18:43,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 119 transitions. [2024-10-12 00:18:43,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:43,190 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 119 transitions. [2024-10-12 00:18:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 119 transitions. [2024-10-12 00:18:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-10-12 00:18:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.2875) internal successors, (103), 79 states have internal predecessors, (103), 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:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2024-10-12 00:18:43,196 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 103 transitions. [2024-10-12 00:18:43,196 INFO L425 stractBuchiCegarLoop]: Abstraction has 80 states and 103 transitions. [2024-10-12 00:18:43,196 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:18:43,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 103 transitions. [2024-10-12 00:18:43,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:18:43,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:43,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:43,197 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:43,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:43,198 INFO L745 eck$LassoCheckResult]: Stem: 961#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 962#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 970#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 973#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 955#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 956#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 975#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1011#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1004#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 958#L559-1 [2024-10-12 00:18:43,198 INFO L747 eck$LassoCheckResult]: Loop: 958#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 957#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 958#L559-1 [2024-10-12 00:18:43,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1215726572, now seen corresponding path program 1 times [2024-10-12 00:18:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:43,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698982975] [2024-10-12 00:18:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:43,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:43,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:43,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:43,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 2 times [2024-10-12 00:18:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:43,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641110634] [2024-10-12 00:18:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:43,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:43,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:43,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:43,246 INFO L85 PathProgramCache]: Analyzing trace with hash 82132647, now seen corresponding path program 2 times [2024-10-12 00:18:43,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:43,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373147423] [2024-10-12 00:18:43,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:43,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:43,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:43,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:43,689 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:43,689 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:43,689 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:43,690 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:43,690 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:43,690 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:43,690 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:43,690 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:43,690 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration9_Lasso [2024-10-12 00:18:43,690 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:43,690 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:43,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:43,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:44,059 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:44,060 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:44,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,063 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:44,063 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:44,064 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:44,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:44,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:44,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:44,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:44,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-12 00:18:44,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,088 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:44,101 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:44,102 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:44,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:44,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-12 00:18:44,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:44,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:44,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:44,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-10-12 00:18:44,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,138 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:44,140 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:44,140 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:44,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:44,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:44,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:44,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:44,163 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:44,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,164 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:44,165 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:44,166 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:44,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:44,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:44,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:44,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:44,189 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:44,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,191 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:44,191 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:44,193 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:44,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:44,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:44,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:44,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:44,215 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:44,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,217 INFO L229 MonitoredProcess]: Starting monitored process 43 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:44,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:18:44,218 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:44,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:44,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:44,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:44,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:44,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-12 00:18:44,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,244 INFO L229 MonitoredProcess]: Starting monitored process 44 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:44,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:18:44,246 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:44,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:44,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:44,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:44,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:44,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-12 00:18:44,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,273 INFO L229 MonitoredProcess]: Starting monitored process 45 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:44,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:18:44,274 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:44,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:44,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:44,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:44,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-12 00:18:44,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,300 INFO L229 MonitoredProcess]: Starting monitored process 46 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:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:18:44,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:44,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:44,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:44,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:44,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:44,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-12 00:18:44,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,325 INFO L229 MonitoredProcess]: Starting monitored process 47 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:44,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-12 00:18:44,326 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:44,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:44,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:44,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:44,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:44,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-12 00:18:44,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,351 INFO L229 MonitoredProcess]: Starting monitored process 48 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:44,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-12 00:18:44,353 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:44,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:44,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:44,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:44,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-12 00:18:44,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,378 INFO L229 MonitoredProcess]: Starting monitored process 49 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:44,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-12 00:18:44,380 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:44,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:44,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:44,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:44,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:44,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:44,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:44,403 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:44,419 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-12 00:18:44,419 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-12 00:18:44,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:44,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,422 INFO L229 MonitoredProcess]: Starting monitored process 50 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:44,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-12 00:18:44,424 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:44,437 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-12 00:18:44,437 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:44,437 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_1 Supporting invariants [1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_1 - 1*ULTIMATE.start_test_fun_#t~mem11#1 >= 0] [2024-10-12 00:18:44,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-12 00:18:44,461 INFO L156 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2024-10-12 00:18:44,464 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 00:18:44,464 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 00:18:44,464 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-10-12 00:18:44,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:44,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:18:44,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:44,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:44,558 WARN L253 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:18:44,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:44,577 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 43 treesize of output 16 [2024-10-12 00:18:44,593 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:44,594 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:44,594 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 103 transitions. cyclomatic complexity: 35 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:44,631 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 103 transitions. cyclomatic complexity: 35. 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 137 states and 174 transitions. Complement of second has 5 states. [2024-10-12 00:18:44,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:44,633 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:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-10-12 00:18:44,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2024-10-12 00:18:44,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:44,633 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:44,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:44,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:18:44,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:44,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:44,729 WARN L253 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:18:44,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:44,739 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 43 treesize of output 16 [2024-10-12 00:18:44,758 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:44,759 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:44,759 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 103 transitions. cyclomatic complexity: 35 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:44,798 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 103 transitions. cyclomatic complexity: 35. 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 163 states and 210 transitions. Complement of second has 6 states. [2024-10-12 00:18:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:44,805 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:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-12 00:18:44,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2024-10-12 00:18:44,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:44,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2024-10-12 00:18:44,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:44,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-12 00:18:44,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:44,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 210 transitions. [2024-10-12 00:18:44,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-10-12 00:18:44,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 151 states and 194 transitions. [2024-10-12 00:18:44,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:18:44,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:18:44,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 194 transitions. [2024-10-12 00:18:44,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:44,813 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 194 transitions. [2024-10-12 00:18:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 194 transitions. [2024-10-12 00:18:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 110. [2024-10-12 00:18:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.2818181818181817) internal successors, (141), 109 states have internal predecessors, (141), 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:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2024-10-12 00:18:44,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 141 transitions. [2024-10-12 00:18:44,821 INFO L425 stractBuchiCegarLoop]: Abstraction has 110 states and 141 transitions. [2024-10-12 00:18:44,821 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:18:44,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 141 transitions. [2024-10-12 00:18:44,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:18:44,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:44,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:44,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1] [2024-10-12 00:18:44,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:44,823 INFO L745 eck$LassoCheckResult]: Stem: 1478#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1482#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 1485#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 1540#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1539#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 1538#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1537#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1497#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1490#L559-1 assume !(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1; 1496#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 1495#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 1494#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1493#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 1492#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1491#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1489#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1475#L559-1 [2024-10-12 00:18:44,823 INFO L747 eck$LassoCheckResult]: Loop: 1475#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1474#L559-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1475#L559-1 [2024-10-12 00:18:44,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2055714993, now seen corresponding path program 2 times [2024-10-12 00:18:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317006723] [2024-10-12 00:18:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 00:18:44,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317006723] [2024-10-12 00:18:44,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317006723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:18:44,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:18:44,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:18:44,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41037776] [2024-10-12 00:18:44,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:18:44,926 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:44,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 3 times [2024-10-12 00:18:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:44,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222393403] [2024-10-12 00:18:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:44,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:44,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:44,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:18:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:18:44,975 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. cyclomatic complexity: 47 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:45,002 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2024-10-12 00:18:45,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 105 transitions. [2024-10-12 00:18:45,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:45,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 24 states and 27 transitions. [2024-10-12 00:18:45,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-12 00:18:45,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-12 00:18:45,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2024-10-12 00:18:45,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:45,005 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-12 00:18:45,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2024-10-12 00:18:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-12 00:18:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-10-12 00:18:45,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-12 00:18:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:18:45,008 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-12 00:18:45,008 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:18:45,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2024-10-12 00:18:45,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:45,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:45,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:45,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 3, 2, 2, 2, 2, 1, 1, 1] [2024-10-12 00:18:45,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:45,009 INFO L745 eck$LassoCheckResult]: Stem: 1682#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1683#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1687#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 1684#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 1685#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1690#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 1691#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 1688#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 1678#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 1679#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 1699#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 1692#L555-1 assume !(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1; 1689#L559-4 call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 1686#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 1680#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1681#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 1696#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 1695#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 1693#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 1677#L555-1 [2024-10-12 00:18:45,010 INFO L747 eck$LassoCheckResult]: Loop: 1677#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 1676#L555-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 1677#L555-1 [2024-10-12 00:18:45,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:45,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2121929575, now seen corresponding path program 2 times [2024-10-12 00:18:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:45,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860560927] [2024-10-12 00:18:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:45,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 00:18:45,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:45,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860560927] [2024-10-12 00:18:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860560927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:18:45,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:18:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:18:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838302537] [2024-10-12 00:18:45,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:18:45,096 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:45,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1948, now seen corresponding path program 2 times [2024-10-12 00:18:45,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:45,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295010156] [2024-10-12 00:18:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:45,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:45,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:45,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:45,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:18:45,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:18:45,145 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:45,168 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-12 00:18:45,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2024-10-12 00:18:45,169 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:18:45,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2024-10-12 00:18:45,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:18:45,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:18:45,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:18:45,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:18:45,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:18:45,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:18:45,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:18:45,170 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:18:45,170 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:18:45,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:18:45,171 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:18:45,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:18:45,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:18:45 BoogieIcfgContainer [2024-10-12 00:18:45,179 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:18:45,180 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:18:45,180 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:18:45,180 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:18:45,181 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:35" (3/4) ... [2024-10-12 00:18:45,182 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:18:45,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:18:45,184 INFO L158 Benchmark]: Toolchain (without parser) took 10542.12ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 132.8MB in the beginning and 61.5MB in the end (delta: 71.4MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. [2024-10-12 00:18:45,185 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 167.8MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:18:45,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.02ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 113.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 00:18:45,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.42ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 112.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:18:45,185 INFO L158 Benchmark]: Boogie Preprocessor took 42.32ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 110.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:18:45,186 INFO L158 Benchmark]: RCFGBuilder took 435.32ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 96.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 00:18:45,186 INFO L158 Benchmark]: BuchiAutomizer took 9539.94ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 96.0MB in the beginning and 61.5MB in the end (delta: 34.5MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2024-10-12 00:18:45,186 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 216.0MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:18:45,187 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.56ms. Allocated memory is still 167.8MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.02ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 113.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.42ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 112.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.32ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 110.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 435.32ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 96.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 9539.94ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 96.0MB in the beginning and 61.5MB in the end (delta: 34.5MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 216.0MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#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[~y_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[~x_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[~x_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[~y_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 8 locations. 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. 7 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.4s and 12 iterations. TraceHistogramMax:5. Analysis of lassos took 7.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 71 StatesRemovedByMinimization, 7 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 [3, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 8/8 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 133 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital176 mio100 ax110 hnf100 lsp91 ukn63 mio100 lsp28 div100 bol103 ite100 ukn100 eq158 hnf91 smp96 dnf115 smp92 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 60ms VariablesStem: 3 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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:45,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-12 00:18:45,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:45,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE