./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/recursified_loop-simple/recursified_nested_3.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 01:01:28,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 01:01:28,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 01:01:28,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 01:01:28,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 01:01:28,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 01:01:28,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 01:01:28,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 01:01:28,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 01:01:28,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 01:01:28,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 01:01:28,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 01:01:28,288 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 01:01:28,289 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 01:01:28,289 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 01:01:28,289 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 01:01:28,289 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 01:01:28,289 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 01:01:28,290 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 01:01:28,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 01:01:28,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 01:01:28,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 01:01:28,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 01:01:28,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 01:01:28,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 01:01:28,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 01:01:28,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 01:01:28,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 01:01:28,292 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 01:01:28,293 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 01:01:28,293 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 01:01:28,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 01:01:28,293 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 01:01:28,294 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 01:01:28,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 01:01:28,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 01:01:28,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 01:01:28,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 01:01:28,295 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 01:01:28,295 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2024-10-12 01:01:28,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 01:01:28,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 01:01:28,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 01:01:28,517 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 01:01:28,517 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 01:01:28,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-10-12 01:01:29,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 01:01:29,889 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 01:01:29,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-10-12 01:01:29,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3da9391f6/239f49cab27d4d2b9db0c98c8177b286/FLAGfd933d634 [2024-10-12 01:01:29,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3da9391f6/239f49cab27d4d2b9db0c98c8177b286 [2024-10-12 01:01:29,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 01:01:29,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 01:01:29,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 01:01:29,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 01:01:29,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 01:01:29,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:01:29" (1/1) ... [2024-10-12 01:01:29,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ed89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:29, skipping insertion in model container [2024-10-12 01:01:29,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:01:29" (1/1) ... [2024-10-12 01:01:29,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 01:01:30,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:01:30,082 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 01:01:30,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:01:30,115 INFO L204 MainTranslator]: Completed translation [2024-10-12 01:01:30,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30 WrapperNode [2024-10-12 01:01:30,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 01:01:30,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 01:01:30,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 01:01:30,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 01:01:30,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 01:01:30" (1/1) ... [2024-10-12 01:01:30,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (1/1) ... [2024-10-12 01:01:30,147 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-10-12 01:01:30,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 01:01:30,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 01:01:30,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 01:01:30,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 01:01:30,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (1/1) ... [2024-10-12 01:01:30,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (1/1) ... [2024-10-12 01:01:30,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (1/1) ... [2024-10-12 01:01:30,187 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 6, 6, 6]. 30 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 6 writes are split as follows [0, 2, 2, 2]. [2024-10-12 01:01:30,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (1/1) ... [2024-10-12 01:01:30,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (1/1) ... [2024-10-12 01:01:30,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (1/1) ... [2024-10-12 01:01:30,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (1/1) ... [2024-10-12 01:01:30,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (1/1) ... [2024-10-12 01:01:30,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (1/1) ... [2024-10-12 01:01:30,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 01:01:30,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 01:01:30,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 01:01:30,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 01:01:30,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (1/1) ... [2024-10-12 01:01:30,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:01:30,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:30,233 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 01:01:30,235 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 01:01:30,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 01:01:30,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 01:01:30,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 01:01:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 01:01:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 01:01:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 01:01:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 01:01:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 01:01:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 01:01:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 01:01:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2024-10-12 01:01:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2024-10-12 01:01:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-10-12 01:01:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-10-12 01:01:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 01:01:30,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 01:01:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 01:01:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 01:01:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 01:01:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 01:01:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2024-10-12 01:01:30,280 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2024-10-12 01:01:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 01:01:30,357 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 01:01:30,360 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 01:01:30,549 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-12 01:01:30,549 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 01:01:30,564 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 01:01:30,565 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 01:01:30,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:01:30 BoogieIcfgContainer [2024-10-12 01:01:30,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 01:01:30,567 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 01:01:30,567 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 01:01:30,571 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 01:01:30,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:01:30,572 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 01:01:29" (1/3) ... [2024-10-12 01:01:30,573 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4310941e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:01:30, skipping insertion in model container [2024-10-12 01:01:30,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:01:30,573 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:30" (2/3) ... [2024-10-12 01:01:30,574 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4310941e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:01:30, skipping insertion in model container [2024-10-12 01:01:30,574 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:01:30,574 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:01:30" (3/3) ... [2024-10-12 01:01:30,575 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_3.c [2024-10-12 01:01:30,675 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 01:01:30,675 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 01:01:30,675 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 01:01:30,675 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 01:01:30,675 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 01:01:30,675 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 01:01:30,675 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 01:01:30,675 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 01:01:30,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 01:01:30,700 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:30,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:30,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:30,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:30,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:30,706 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 01:01:30,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 01:01:30,708 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:30,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:30,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:30,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:30,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:30,715 INFO L745 eck$LassoCheckResult]: Stem: 30#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 5#L86true call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 28#$Ultimate##0true [2024-10-12 01:01:30,715 INFO L747 eck$LassoCheckResult]: Loop: 28#$Ultimate##0true ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 16#L61true assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 31#L67true call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 25#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 19#L41true assume !(#t~mem7 < 6);havoc #t~mem7; 18#L41-1true assume true; 27#func_to_recursive_line_22_to_23_0EXITtrue >#70#return; 32#L67-1true call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 3#L72true call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 28#$Ultimate##0true [2024-10-12 01:01:30,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 1 times [2024-10-12 01:01:30,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:30,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322115494] [2024-10-12 01:01:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:30,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:30,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:30,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:30,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1113047060, now seen corresponding path program 1 times [2024-10-12 01:01:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:30,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878488068] [2024-10-12 01:01:30,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:30,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:31,169 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 01:01:31,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:31,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878488068] [2024-10-12 01:01:31,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878488068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:01:31,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:01:31,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 01:01:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176489644] [2024-10-12 01:01:31,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:01:31,175 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 01:01:31,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 01:01:31,209 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 01:01:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:31,338 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-10-12 01:01:31,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2024-10-12 01:01:31,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:31,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 24 states and 29 transitions. [2024-10-12 01:01:31,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-12 01:01:31,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-12 01:01:31,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2024-10-12 01:01:31,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:31,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-12 01:01:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2024-10-12 01:01:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-10-12 01:01:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-12 01:01:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-12 01:01:31,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-12 01:01:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 01:01:31,380 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-12 01:01:31,380 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 01:01:31,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2024-10-12 01:01:31,381 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:31,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:31,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:31,381 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:31,381 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:31,382 INFO L745 eck$LassoCheckResult]: Stem: 108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 90#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 91#$Ultimate##0 [2024-10-12 01:01:31,382 INFO L747 eck$LassoCheckResult]: Loop: 91#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 107#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 97#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 102#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 101#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 93#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 92#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 95#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 104#L25-1 assume true; 103#func_to_recursive_line_23_to_23_0EXIT >#64#return; 100#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 98#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 102#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 101#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 96#L41-1 assume true; 99#func_to_recursive_line_22_to_23_0EXIT >#66#return; 106#L41-1 assume true; 110#func_to_recursive_line_22_to_23_0EXIT >#70#return; 109#L67-1 call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 89#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 91#$Ultimate##0 [2024-10-12 01:01:31,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 2 times [2024-10-12 01:01:31,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:31,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110506914] [2024-10-12 01:01:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:31,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:31,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:31,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1122494970, now seen corresponding path program 1 times [2024-10-12 01:01:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:31,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316836091] [2024-10-12 01:01:31,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:31,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:31,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 01:01:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 01:01:31,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:31,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316836091] [2024-10-12 01:01:31,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316836091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:01:31,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:01:31,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 01:01:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553539100] [2024-10-12 01:01:31,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:01:31,683 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:31,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 01:01:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 01:01:31,684 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 01:01:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:31,767 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-10-12 01:01:31,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2024-10-12 01:01:31,768 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:31,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2024-10-12 01:01:31,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-12 01:01:31,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-12 01:01:31,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2024-10-12 01:01:31,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:31,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-12 01:01:31,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2024-10-12 01:01:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-12 01:01:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 01:01:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-12 01:01:31,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-12 01:01:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 01:01:31,777 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-12 01:01:31,777 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 01:01:31,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2024-10-12 01:01:31,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:31,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:31,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:31,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:31,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:31,780 INFO L745 eck$LassoCheckResult]: Stem: 192#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 173#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 174#$Ultimate##0 [2024-10-12 01:01:31,780 INFO L747 eck$LassoCheckResult]: Loop: 174#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 191#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 176#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 185#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 184#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 180#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 179#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 182#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 181#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 179#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 182#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 189#L25-1 assume true; 186#func_to_recursive_line_23_to_23_0EXIT >#62#return; 187#L25-1 assume true; 195#func_to_recursive_line_23_to_23_0EXIT >#64#return; 183#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 177#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 185#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 184#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 175#L41-1 assume true; 178#func_to_recursive_line_22_to_23_0EXIT >#66#return; 190#L41-1 assume true; 194#func_to_recursive_line_22_to_23_0EXIT >#70#return; 193#L67-1 call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 172#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 174#$Ultimate##0 [2024-10-12 01:01:31,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 3 times [2024-10-12 01:01:31,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:31,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585754506] [2024-10-12 01:01:31,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:31,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:31,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:31,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:31,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1944809856, now seen corresponding path program 1 times [2024-10-12 01:01:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:31,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730602325] [2024-10-12 01:01:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:31,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:32,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:32,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:32,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 01:01:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 01:01:32,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:32,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730602325] [2024-10-12 01:01:32,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730602325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:32,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157106714] [2024-10-12 01:01:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:32,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:32,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:32,233 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 01:01:32,234 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 01:01:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:32,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 01:01:32,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:32,357 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 01:01:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 01:01:32,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 01:01:32,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157106714] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:32,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:32,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2024-10-12 01:01:32,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178675001] [2024-10-12 01:01:32,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:32,911 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:32,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 01:01:32,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-10-12 01:01:32,912 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 25 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 10 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-12 01:01:33,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:33,343 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-10-12 01:01:33,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2024-10-12 01:01:33,348 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:33,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2024-10-12 01:01:33,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-12 01:01:33,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-12 01:01:33,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2024-10-12 01:01:33,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:33,350 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-12 01:01:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2024-10-12 01:01:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 01:01:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 01:01:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-12 01:01:33,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-12 01:01:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 01:01:33,356 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-12 01:01:33,357 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 01:01:33,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2024-10-12 01:01:33,357 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:33,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:33,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:33,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:33,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:33,359 INFO L745 eck$LassoCheckResult]: Stem: 472#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 466#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 453#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 454#$Ultimate##0 [2024-10-12 01:01:33,359 INFO L747 eck$LassoCheckResult]: Loop: 454#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 471#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 456#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 465#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 463#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 460#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 462#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 461#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 462#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 461#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 462#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 469#L25-1 assume true; 467#func_to_recursive_line_23_to_23_0EXIT >#62#return; 468#L25-1 assume true; 479#func_to_recursive_line_23_to_23_0EXIT >#62#return; 478#L25-1 assume true; 477#func_to_recursive_line_23_to_23_0EXIT >#64#return; 464#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 457#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 465#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 463#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 460#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 462#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 461#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 462#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 461#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 462#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 469#L25-1 assume true; 467#func_to_recursive_line_23_to_23_0EXIT >#62#return; 468#L25-1 assume true; 479#func_to_recursive_line_23_to_23_0EXIT >#62#return; 478#L25-1 assume true; 477#func_to_recursive_line_23_to_23_0EXIT >#64#return; 464#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 457#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 465#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 463#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 455#L41-1 assume true; 458#func_to_recursive_line_22_to_23_0EXIT >#66#return; 470#L41-1 assume true; 476#func_to_recursive_line_22_to_23_0EXIT >#66#return; 475#L41-1 assume true; 474#func_to_recursive_line_22_to_23_0EXIT >#70#return; 473#L67-1 call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 452#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 454#$Ultimate##0 [2024-10-12 01:01:33,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 4 times [2024-10-12 01:01:33,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:33,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683466716] [2024-10-12 01:01:33,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:33,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:33,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:33,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:33,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1306331242, now seen corresponding path program 2 times [2024-10-12 01:01:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517695663] [2024-10-12 01:01:33,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:33,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:33,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:34,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:34,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:34,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:34,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-12 01:01:34,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517695663] [2024-10-12 01:01:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517695663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408798700] [2024-10-12 01:01:34,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 01:01:34,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:34,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:34,309 INFO L229 MonitoredProcess]: Starting monitored process 3 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 01:01:34,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 01:01:34,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 01:01:34,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:01:34,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-12 01:01:34,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:34,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 01:01:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 01:01:34,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 01:01:35,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408798700] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:35,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:35,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 30 [2024-10-12 01:01:35,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19981715] [2024-10-12 01:01:35,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:35,225 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:35,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:35,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 01:01:35,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2024-10-12 01:01:35,226 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 30 states, 22 states have (on average 2.227272727272727) internal successors, (49), 25 states have internal predecessors, (49), 10 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (17), 7 states have call predecessors, (17), 10 states have call successors, (17) [2024-10-12 01:01:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:35,557 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-10-12 01:01:35,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2024-10-12 01:01:35,558 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:35,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2024-10-12 01:01:35,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-10-12 01:01:35,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-10-12 01:01:35,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2024-10-12 01:01:35,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:35,562 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-12 01:01:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2024-10-12 01:01:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-12 01:01:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-12 01:01:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-12 01:01:35,565 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-12 01:01:35,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 01:01:35,566 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-12 01:01:35,566 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 01:01:35,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2024-10-12 01:01:35,567 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:35,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:35,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:35,568 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:35,568 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:35,568 INFO L745 eck$LassoCheckResult]: Stem: 1008#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1004#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 989#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 990#$Ultimate##0 [2024-10-12 01:01:35,568 INFO L747 eck$LassoCheckResult]: Loop: 990#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 1007#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 993#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1001#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1000#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 997#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 998#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1005#L25-1 assume true; 1002#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1003#L25-1 assume true; 1019#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1018#L25-1 assume true; 1017#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1016#L25-1 assume true; 1015#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1014#L25-1 assume true; 1013#func_to_recursive_line_23_to_23_0EXIT >#64#return; 999#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 992#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1001#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1000#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 997#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 998#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1005#L25-1 assume true; 1002#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1003#L25-1 assume true; 1019#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1018#L25-1 assume true; 1017#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1016#L25-1 assume true; 1015#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1014#L25-1 assume true; 1013#func_to_recursive_line_23_to_23_0EXIT >#64#return; 999#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 992#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1001#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1000#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 991#L41-1 assume true; 994#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1006#L41-1 assume true; 1012#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1011#L41-1 assume true; 1010#func_to_recursive_line_22_to_23_0EXIT >#70#return; 1009#L67-1 call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 988#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 990#$Ultimate##0 [2024-10-12 01:01:35,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 5 times [2024-10-12 01:01:35,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:35,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402236621] [2024-10-12 01:01:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:35,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:35,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:35,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash -909942614, now seen corresponding path program 3 times [2024-10-12 01:01:35,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:35,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027917202] [2024-10-12 01:01:35,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:35,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:01:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:01:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 10 proven. 118 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-12 01:01:36,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027917202] [2024-10-12 01:01:36,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027917202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852010795] [2024-10-12 01:01:36,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 01:01:36,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:36,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:36,741 INFO L229 MonitoredProcess]: Starting monitored process 4 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 01:01:36,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 01:01:36,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 01:01:36,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:01:36,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-12 01:01:36,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:36,841 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 01:01:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-10-12 01:01:37,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-12 01:01:37,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852010795] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:37,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:37,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 35 [2024-10-12 01:01:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125044166] [2024-10-12 01:01:37,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:37,733 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:37,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:37,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 01:01:37,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 01:01:37,735 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. cyclomatic complexity: 7 Second operand has 35 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 29 states have internal predecessors, (48), 13 states have call successors, (18), 8 states have call predecessors, (18), 13 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-10-12 01:01:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:38,181 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-10-12 01:01:38,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2024-10-12 01:01:38,182 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:38,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2024-10-12 01:01:38,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-12 01:01:38,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-10-12 01:01:38,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2024-10-12 01:01:38,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:38,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-12 01:01:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2024-10-12 01:01:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-12 01:01:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-12 01:01:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-10-12 01:01:38,186 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-12 01:01:38,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 01:01:38,191 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-12 01:01:38,191 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 01:01:38,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2024-10-12 01:01:38,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:38,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:38,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:38,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:38,193 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:38,193 INFO L745 eck$LassoCheckResult]: Stem: 1804#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1800#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1784#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 1785#$Ultimate##0 [2024-10-12 01:01:38,194 INFO L747 eck$LassoCheckResult]: Loop: 1785#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 1803#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 1788#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1797#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1794#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 1792#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1801#L25-1 assume true; 1798#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1799#L25-1 assume true; 1818#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1817#L25-1 assume true; 1816#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1815#L25-1 assume true; 1814#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1813#L25-1 assume true; 1812#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1811#L25-1 assume true; 1810#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1796#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1787#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1797#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1794#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 1792#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1801#L25-1 assume true; 1798#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1799#L25-1 assume true; 1818#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1817#L25-1 assume true; 1816#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1815#L25-1 assume true; 1814#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1813#L25-1 assume true; 1812#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1811#L25-1 assume true; 1810#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1796#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1787#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1797#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1794#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 1792#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1793#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1801#L25-1 assume true; 1798#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1799#L25-1 assume true; 1818#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1817#L25-1 assume true; 1816#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1815#L25-1 assume true; 1814#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1813#L25-1 assume true; 1812#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1811#L25-1 assume true; 1810#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1796#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1787#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1797#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1794#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1795#L41-1 assume true; 1802#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1786#L41-1 assume true; 1789#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1809#L41-1 assume true; 1808#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1807#L41-1 assume true; 1806#func_to_recursive_line_22_to_23_0EXIT >#70#return; 1805#L67-1 call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 1783#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 1785#$Ultimate##0 [2024-10-12 01:01:38,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:38,194 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 6 times [2024-10-12 01:01:38,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:38,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061927400] [2024-10-12 01:01:38,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:38,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:38,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:38,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash -11960144, now seen corresponding path program 4 times [2024-10-12 01:01:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699906927] [2024-10-12 01:01:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 01:01:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 01:01:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 01:01:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 14 proven. 307 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-10-12 01:01:40,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:40,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699906927] [2024-10-12 01:01:40,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699906927] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:40,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201293168] [2024-10-12 01:01:40,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 01:01:40,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:40,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:40,354 INFO L229 MonitoredProcess]: Starting monitored process 5 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 01:01:40,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 01:01:40,498 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 01:01:40,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:01:40,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-12 01:01:40,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:40,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 01:01:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 346 proven. 35 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-10-12 01:01:40,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 6 proven. 414 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-12 01:01:42,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201293168] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:42,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:42,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 26] total 45 [2024-10-12 01:01:42,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602658014] [2024-10-12 01:01:42,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:42,580 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:42,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:42,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-12 01:01:42,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2024-10-12 01:01:42,581 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. cyclomatic complexity: 7 Second operand has 45 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 37 states have internal predecessors, (61), 13 states have call successors, (25), 10 states have call predecessors, (25), 15 states have return successors, (26), 13 states have call predecessors, (26), 13 states have call successors, (26) [2024-10-12 01:01:42,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:42,928 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-12 01:01:42,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2024-10-12 01:01:42,929 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:42,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 42 transitions. [2024-10-12 01:01:42,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-10-12 01:01:42,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-10-12 01:01:42,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 42 transitions. [2024-10-12 01:01:42,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:42,930 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-12 01:01:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 42 transitions. [2024-10-12 01:01:42,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-12 01:01:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 01:01:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-10-12 01:01:42,933 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-12 01:01:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 01:01:42,934 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-12 01:01:42,934 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 01:01:42,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2024-10-12 01:01:42,934 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:42,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:42,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:42,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:42,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:42,936 INFO L745 eck$LassoCheckResult]: Stem: 3168#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 3164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3149#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 3150#$Ultimate##0 [2024-10-12 01:01:42,937 INFO L747 eck$LassoCheckResult]: Loop: 3150#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 3167#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 3152#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3161#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 3160#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 3156#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3165#L25-1 assume true; 3162#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3163#L25-1 assume true; 3185#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3184#L25-1 assume true; 3183#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3182#L25-1 assume true; 3181#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3180#L25-1 assume true; 3179#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3178#L25-1 assume true; 3177#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3176#L25-1 assume true; 3175#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3159#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3153#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3161#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 3160#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 3156#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3165#L25-1 assume true; 3162#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3163#L25-1 assume true; 3185#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3184#L25-1 assume true; 3183#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3182#L25-1 assume true; 3181#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3180#L25-1 assume true; 3179#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3178#L25-1 assume true; 3177#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3176#L25-1 assume true; 3175#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3159#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3153#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3161#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 3160#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 3156#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3158#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3165#L25-1 assume true; 3162#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3163#L25-1 assume true; 3185#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3184#L25-1 assume true; 3183#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3182#L25-1 assume true; 3181#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3180#L25-1 assume true; 3179#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3178#L25-1 assume true; 3177#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3176#L25-1 assume true; 3175#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3159#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3153#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3161#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 3160#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3151#L41-1 assume true; 3154#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3166#L41-1 assume true; 3174#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3173#L41-1 assume true; 3172#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3171#L41-1 assume true; 3170#func_to_recursive_line_22_to_23_0EXIT >#70#return; 3169#L67-1 call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 3148#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 3150#$Ultimate##0 [2024-10-12 01:01:42,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 7 times [2024-10-12 01:01:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:42,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972989191] [2024-10-12 01:01:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:42,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:42,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:42,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:42,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1552670328, now seen corresponding path program 5 times [2024-10-12 01:01:42,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:42,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443255100] [2024-10-12 01:01:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:43,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2024-10-12 01:01:44,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443255100] [2024-10-12 01:01:44,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443255100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:44,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323783071] [2024-10-12 01:01:44,582 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 01:01:44,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:44,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:44,584 INFO L229 MonitoredProcess]: Starting monitored process 6 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 01:01:44,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 01:01:45,094 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-10-12 01:01:45,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:01:45,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-12 01:01:45,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:45,107 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 01:01:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2024-10-12 01:01:45,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-10-12 01:01:46,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323783071] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:46,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:46,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 18] total 31 [2024-10-12 01:01:46,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956942833] [2024-10-12 01:01:46,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:46,177 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:46,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:46,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-12 01:01:46,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2024-10-12 01:01:46,178 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. cyclomatic complexity: 7 Second operand has 31 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 13 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-10-12 01:01:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:46,383 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-10-12 01:01:46,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 44 transitions. [2024-10-12 01:01:46,383 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:46,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 44 transitions. [2024-10-12 01:01:46,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-10-12 01:01:46,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-10-12 01:01:46,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2024-10-12 01:01:46,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:46,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-10-12 01:01:46,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2024-10-12 01:01:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-12 01:01:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-12 01:01:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-10-12 01:01:46,387 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-10-12 01:01:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 01:01:46,390 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-10-12 01:01:46,390 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 01:01:46,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2024-10-12 01:01:46,391 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:46,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:46,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:46,393 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:46,393 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:46,393 INFO L745 eck$LassoCheckResult]: Stem: 4737#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 4732#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 4716#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 4717#$Ultimate##0 [2024-10-12 01:01:46,393 INFO L747 eck$LassoCheckResult]: Loop: 4717#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 4736#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 4719#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4729#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 4726#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 4723#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4734#L25-1 assume true; 4730#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4731#L25-1 assume true; 4733#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4754#L25-1 assume true; 4753#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4752#L25-1 assume true; 4751#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4750#L25-1 assume true; 4749#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4748#L25-1 assume true; 4747#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4746#L25-1 assume true; 4745#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4728#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4720#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4729#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 4726#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 4723#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4734#L25-1 assume true; 4730#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4731#L25-1 assume true; 4733#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4754#L25-1 assume true; 4753#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4752#L25-1 assume true; 4751#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4750#L25-1 assume true; 4749#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4748#L25-1 assume true; 4747#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4746#L25-1 assume true; 4745#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4728#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4720#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4729#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 4726#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 4723#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4734#L25-1 assume true; 4730#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4731#L25-1 assume true; 4733#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4754#L25-1 assume true; 4753#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4752#L25-1 assume true; 4751#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4750#L25-1 assume true; 4749#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4748#L25-1 assume true; 4747#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4746#L25-1 assume true; 4745#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4728#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4720#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4729#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 4726#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 4723#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4724#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4722#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4725#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4734#L25-1 assume true; 4730#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4731#L25-1 assume true; 4733#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4754#L25-1 assume true; 4753#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4752#L25-1 assume true; 4751#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4750#L25-1 assume true; 4749#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4748#L25-1 assume true; 4747#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4746#L25-1 assume true; 4745#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4728#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4720#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4729#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 4726#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4727#L41-1 assume true; 4735#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4718#L41-1 assume true; 4721#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4744#L41-1 assume true; 4743#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4742#L41-1 assume true; 4741#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4740#L41-1 assume true; 4739#func_to_recursive_line_22_to_23_0EXIT >#70#return; 4738#L67-1 call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 4715#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 4717#$Ultimate##0 [2024-10-12 01:01:46,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 8 times [2024-10-12 01:01:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:46,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16673950] [2024-10-12 01:01:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:46,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:46,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:46,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1383958808, now seen corresponding path program 6 times [2024-10-12 01:01:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:46,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281391990] [2024-10-12 01:01:46,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:46,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:48,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:49,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:49,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:49,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:49,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1822 trivial. 0 not checked. [2024-10-12 01:01:49,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:49,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281391990] [2024-10-12 01:01:49,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281391990] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:49,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112792000] [2024-10-12 01:01:49,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 01:01:49,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:49,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:49,127 INFO L229 MonitoredProcess]: Starting monitored process 7 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 01:01:49,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 01:01:49,580 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2024-10-12 01:01:49,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:01:49,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-12 01:01:49,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:49,601 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 01:01:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1822 trivial. 0 not checked. [2024-10-12 01:01:49,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2024-10-12 01:01:51,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112792000] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:51,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:51,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 22] total 36 [2024-10-12 01:01:51,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315169815] [2024-10-12 01:01:51,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:51,194 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:51,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:51,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-12 01:01:51,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1014, Unknown=0, NotChecked=0, Total=1260 [2024-10-12 01:01:51,195 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. cyclomatic complexity: 7 Second operand has 36 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 15 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2024-10-12 01:01:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:51,416 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-10-12 01:01:51,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 46 transitions. [2024-10-12 01:01:51,417 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:51,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 46 transitions. [2024-10-12 01:01:51,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-12 01:01:51,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-12 01:01:51,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2024-10-12 01:01:51,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:51,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-10-12 01:01:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2024-10-12 01:01:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-12 01:01:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 13 states have return successors, (15), 13 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-12 01:01:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-10-12 01:01:51,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-10-12 01:01:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 01:01:51,425 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-10-12 01:01:51,426 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 01:01:51,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 46 transitions. [2024-10-12 01:01:51,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:51,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:51,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:51,429 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:51,429 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:51,429 INFO L745 eck$LassoCheckResult]: Stem: 6860#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 6853#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 6839#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 6840#$Ultimate##0 [2024-10-12 01:01:51,429 INFO L747 eck$LassoCheckResult]: Loop: 6840#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 6859#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 6842#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6852#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6849#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 6846#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6857#L25-1 assume true; 6854#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6855#L25-1 assume true; 6856#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6879#L25-1 assume true; 6878#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6877#L25-1 assume true; 6876#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6875#L25-1 assume true; 6874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6873#L25-1 assume true; 6871#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6869#L25-1 assume true; 6868#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6851#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6843#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6852#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6849#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 6846#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6857#L25-1 assume true; 6854#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6855#L25-1 assume true; 6856#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6879#L25-1 assume true; 6878#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6877#L25-1 assume true; 6876#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6875#L25-1 assume true; 6874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6873#L25-1 assume true; 6871#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6869#L25-1 assume true; 6868#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6851#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6843#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6852#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6849#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 6846#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6857#L25-1 assume true; 6854#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6855#L25-1 assume true; 6856#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6879#L25-1 assume true; 6878#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6877#L25-1 assume true; 6876#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6875#L25-1 assume true; 6874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6873#L25-1 assume true; 6871#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6869#L25-1 assume true; 6868#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6851#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6843#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6852#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6849#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 6846#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6857#L25-1 assume true; 6854#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6855#L25-1 assume true; 6856#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6879#L25-1 assume true; 6878#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6877#L25-1 assume true; 6876#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6875#L25-1 assume true; 6874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6873#L25-1 assume true; 6871#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6869#L25-1 assume true; 6868#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6851#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6843#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6852#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6849#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 6846#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6847#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6845#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6848#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6857#L25-1 assume true; 6854#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6855#L25-1 assume true; 6856#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6879#L25-1 assume true; 6878#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6877#L25-1 assume true; 6876#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6875#L25-1 assume true; 6874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6873#L25-1 assume true; 6871#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6869#L25-1 assume true; 6868#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6851#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6843#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6852#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6849#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6850#L41-1 assume true; 6858#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6841#L41-1 assume true; 6844#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6872#L41-1 assume true; 6870#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6867#L41-1 assume true; 6866#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6865#L41-1 assume true; 6864#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6863#L41-1 assume true; 6862#func_to_recursive_line_22_to_23_0EXIT >#70#return; 6861#L67-1 call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 6838#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 6840#$Ultimate##0 [2024-10-12 01:01:51,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 9 times [2024-10-12 01:01:51,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:51,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24071055] [2024-10-12 01:01:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:51,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:51,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:51,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1937132614, now seen corresponding path program 7 times [2024-10-12 01:01:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:51,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258270537] [2024-10-12 01:01:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:51,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:52,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:53,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:53,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:53,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:53,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:53,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:53,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:53,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:53,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:54,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2024-10-12 01:01:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258270537] [2024-10-12 01:01:55,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258270537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884945802] [2024-10-12 01:01:55,417 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-12 01:01:55,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:55,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:55,419 INFO L229 MonitoredProcess]: Starting monitored process 8 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 01:01:55,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 01:01:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:55,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-12 01:01:55,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:55,691 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 01:01:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2024-10-12 01:01:56,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2024-10-12 01:01:57,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884945802] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:57,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:57,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 26] total 40 [2024-10-12 01:01:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204677549] [2024-10-12 01:01:57,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:57,930 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:57,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-12 01:01:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1245, Unknown=0, NotChecked=0, Total=1560 [2024-10-12 01:01:57,931 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. cyclomatic complexity: 7 Second operand has 40 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 16 states have call successors, (20), 11 states have call predecessors, (20), 13 states have return successors, (24), 18 states have call predecessors, (24), 15 states have call successors, (24) [2024-10-12 01:01:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:58,219 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-10-12 01:01:58,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2024-10-12 01:01:58,220 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:58,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 48 transitions. [2024-10-12 01:01:58,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-10-12 01:01:58,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-10-12 01:01:58,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 48 transitions. [2024-10-12 01:01:58,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:58,224 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-10-12 01:01:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 48 transitions. [2024-10-12 01:01:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-12 01:01:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 14 states have return successors, (16), 14 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-12 01:01:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2024-10-12 01:01:58,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-10-12 01:01:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 01:01:58,227 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-10-12 01:01:58,227 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 01:01:58,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2024-10-12 01:01:58,227 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 01:01:58,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:58,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:58,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:58,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:58,229 INFO L745 eck$LassoCheckResult]: Stem: 9578#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 9574#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 9558#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 9559#$Ultimate##0 [2024-10-12 01:01:58,230 INFO L747 eck$LassoCheckResult]: Loop: 9559#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 9577#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 9561#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9571#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 9569#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 9565#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9575#L25-1 assume true; 9572#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9573#L25-1 assume true; 9600#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9599#L25-1 assume true; 9598#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9597#L25-1 assume true; 9595#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9593#L25-1 assume true; 9591#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9590#L25-1 assume true; 9588#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9586#L25-1 assume true; 9585#func_to_recursive_line_23_to_23_0EXIT >#64#return; 9568#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 9562#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9571#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 9569#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 9565#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9575#L25-1 assume true; 9572#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9573#L25-1 assume true; 9600#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9599#L25-1 assume true; 9598#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9597#L25-1 assume true; 9595#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9593#L25-1 assume true; 9591#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9590#L25-1 assume true; 9588#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9586#L25-1 assume true; 9585#func_to_recursive_line_23_to_23_0EXIT >#64#return; 9568#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 9562#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9571#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 9569#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 9565#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9575#L25-1 assume true; 9572#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9573#L25-1 assume true; 9600#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9599#L25-1 assume true; 9598#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9597#L25-1 assume true; 9595#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9593#L25-1 assume true; 9591#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9590#L25-1 assume true; 9588#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9586#L25-1 assume true; 9585#func_to_recursive_line_23_to_23_0EXIT >#64#return; 9568#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 9562#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9571#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 9569#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 9565#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9575#L25-1 assume true; 9572#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9573#L25-1 assume true; 9600#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9599#L25-1 assume true; 9598#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9597#L25-1 assume true; 9595#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9593#L25-1 assume true; 9591#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9590#L25-1 assume true; 9588#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9586#L25-1 assume true; 9585#func_to_recursive_line_23_to_23_0EXIT >#64#return; 9568#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 9562#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9571#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 9569#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 9565#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9575#L25-1 assume true; 9572#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9573#L25-1 assume true; 9600#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9599#L25-1 assume true; 9598#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9597#L25-1 assume true; 9595#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9593#L25-1 assume true; 9591#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9590#L25-1 assume true; 9588#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9586#L25-1 assume true; 9585#func_to_recursive_line_23_to_23_0EXIT >#64#return; 9568#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 9562#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9571#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 9569#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 9565#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9566#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9564#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9567#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9575#L25-1 assume true; 9572#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9573#L25-1 assume true; 9600#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9599#L25-1 assume true; 9598#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9597#L25-1 assume true; 9595#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9593#L25-1 assume true; 9591#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9590#L25-1 assume true; 9588#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9586#L25-1 assume true; 9585#func_to_recursive_line_23_to_23_0EXIT >#64#return; 9568#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 9562#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9571#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 9569#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 9570#L41-1 assume true; 9576#func_to_recursive_line_22_to_23_0EXIT >#66#return; 9560#L41-1 assume true; 9563#func_to_recursive_line_22_to_23_0EXIT >#66#return; 9596#L41-1 assume true; 9594#func_to_recursive_line_22_to_23_0EXIT >#66#return; 9592#L41-1 assume true; 9589#func_to_recursive_line_22_to_23_0EXIT >#66#return; 9587#L41-1 assume true; 9584#func_to_recursive_line_22_to_23_0EXIT >#66#return; 9583#L41-1 assume true; 9582#func_to_recursive_line_22_to_23_0EXIT >#66#return; 9581#L41-1 assume true; 9580#func_to_recursive_line_22_to_23_0EXIT >#70#return; 9579#L67-1 call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 9557#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 9559#$Ultimate##0 [2024-10-12 01:01:58,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:58,231 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 10 times [2024-10-12 01:01:58,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:58,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002765187] [2024-10-12 01:01:58,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:58,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:58,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:58,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:58,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1363312666, now seen corresponding path program 8 times [2024-10-12 01:01:58,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:58,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184210063] [2024-10-12 01:01:58,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:58,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:58,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:58,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:58,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:58,357 INFO L85 PathProgramCache]: Analyzing trace with hash -993962585, now seen corresponding path program 1 times [2024-10-12 01:01:58,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:58,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207251576] [2024-10-12 01:01:58,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:58,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:58,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:58,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:06,483 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:02:06,483 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:02:06,483 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:02:06,483 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:02:06,484 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:02:06,484 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:06,484 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:02:06,484 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:02:06,484 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration10_Lasso [2024-10-12 01:02:06,484 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:02:06,484 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:02:06,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:06,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:06,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:06,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:06,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:06,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:06,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:06,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:06,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:06,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:07,323 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:02:07,326 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:02:07,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,329 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 01:02:07,330 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 01:02:07,332 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 01:02:07,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:07,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:07,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:07,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,361 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 01:02:07,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,363 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 01:02:07,366 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 01:02:07,367 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 01:02:07,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:07,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:07,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:07,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 01:02:07,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,394 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 01:02:07,395 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 01:02:07,396 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 01:02:07,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:07,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:07,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:07,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 01:02:07,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,421 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 01:02:07,422 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 01:02:07,427 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 01:02:07,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:07,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:07,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:07,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:07,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,458 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 01:02:07,459 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 01:02:07,460 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 01:02:07,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:07,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:07,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:07,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,488 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 01:02:07,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,490 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 01:02:07,492 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 01:02:07,494 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 01:02:07,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:07,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:07,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:07,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,521 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 01:02:07,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,524 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 01:02:07,524 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 01:02:07,525 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 01:02:07,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:07,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:07,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:07,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 01:02:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,550 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 01:02:07,554 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 01:02:07,555 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 01:02:07,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,581 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 01:02:07,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,583 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 01:02:07,585 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 01:02:07,586 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 01:02:07,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:07,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,619 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 01:02:07,619 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 01:02:07,620 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 01:02:07,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 01:02:07,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,664 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 01:02:07,665 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 01:02:07,667 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 01:02:07,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:07,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,700 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 01:02:07,702 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 01:02:07,704 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 01:02:07,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:07,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,733 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 01:02:07,734 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 01:02:07,735 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 01:02:07,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:07,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,763 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 01:02:07,764 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 01:02:07,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:02:07,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,795 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 01:02:07,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,796 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 01:02:07,798 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 01:02:07,798 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 01:02:07,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,823 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 01:02:07,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,824 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 01:02:07,825 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 01:02:07,826 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 01:02:07,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:07,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,853 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 01:02:07,854 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 01:02:07,855 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 01:02:07,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:07,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,884 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 01:02:07,889 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 01:02:07,890 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 01:02:07,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,916 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 01:02:07,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,918 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 01:02:07,918 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 01:02:07,919 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 01:02:07,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:07,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,945 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 01:02:07,946 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 01:02:07,946 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 01:02:07,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,969 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 01:02:07,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:07,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:07,971 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 01:02:07,972 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 01:02:07,972 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 01:02:07,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:07,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:07,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:07,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:07,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:07,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:07,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:07,998 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 01:02:07,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:08,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:08,001 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 01:02:08,002 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 01:02:08,003 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 01:02:08,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:08,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:08,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:08,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:08,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:08,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:08,019 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:02:08,036 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-12 01:02:08,036 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-10-12 01:02:08,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:08,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:08,041 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 01:02:08,042 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 01:02:08,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:02:08,057 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 01:02:08,057 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:02:08,058 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 func_to_recursive_line_21_to_22_0_#in~a.base) func_to_recursive_line_21_to_22_0_#in~a.offset)_1) = -2*v_rep(select (select #memory_int#1 func_to_recursive_line_21_to_22_0_#in~a.base) func_to_recursive_line_21_to_22_0_#in~a.offset)_1 + 11 Supporting invariants [] [2024-10-12 01:02:08,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-12 01:02:08,129 INFO L156 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2024-10-12 01:02:08,134 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 01:02:08,135 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 01:02:08,135 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-10-12 01:02:08,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 01:02:08,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 2940 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-10-12 01:02:08,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:09,649 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 20 [2024-10-12 01:02:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4203 trivial. 0 not checked. [2024-10-12 01:02:09,675 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-12 01:02:09,676 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 7 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 01:02:09,831 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 7. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 131 states and 145 transitions. Complement of second has 19 states. [2024-10-12 01:02:09,833 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 01:02:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 01:02:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-12 01:02:09,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 255 letters. [2024-10-12 01:02:09,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:09,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 258 letters. Loop has 255 letters. [2024-10-12 01:02:09,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:09,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 510 letters. [2024-10-12 01:02:09,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:09,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions. [2024-10-12 01:02:09,846 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 01:02:09,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 87 states and 99 transitions. [2024-10-12 01:02:09,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-12 01:02:09,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-10-12 01:02:09,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 99 transitions. [2024-10-12 01:02:09,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:02:09,851 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-10-12 01:02:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 99 transitions. [2024-10-12 01:02:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2024-10-12 01:02:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 21 states have return successors, (25), 22 states have call predecessors, (25), 8 states have call successors, (25) [2024-10-12 01:02:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-10-12 01:02:09,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-10-12 01:02:09,855 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-10-12 01:02:09,855 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 01:02:09,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions. [2024-10-12 01:02:09,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 01:02:09,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:02:09,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:02:09,856 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 01:02:09,856 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:02:09,857 INFO L745 eck$LassoCheckResult]: Stem: 10658#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 10651#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 10622#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 10624#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 10657#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 10640#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10645#$Ultimate##0 [2024-10-12 01:02:09,857 INFO L747 eck$LassoCheckResult]: Loop: 10645#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 10642#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10626#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10625#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10628#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10627#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10625#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10628#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10627#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10625#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10628#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10627#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10625#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10628#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10627#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10625#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10628#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10627#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10625#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10628#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10627#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10625#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10628#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10652#L25-1 assume true; 10647#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10648#L25-1 assume true; 10688#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10687#L25-1 assume true; 10686#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10685#L25-1 assume true; 10684#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10683#L25-1 assume true; 10682#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10681#L25-1 assume true; 10680#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10679#L25-1 assume true; 10678#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10638#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10639#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10645#$Ultimate##0 [2024-10-12 01:02:09,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1482449922, now seen corresponding path program 1 times [2024-10-12 01:02:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657821525] [2024-10-12 01:02:09,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:09,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:09,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:09,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:09,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1388529776, now seen corresponding path program 1 times [2024-10-12 01:02:09,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:09,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014829269] [2024-10-12 01:02:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:09,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:09,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:09,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:09,896 INFO L85 PathProgramCache]: Analyzing trace with hash -292174737, now seen corresponding path program 1 times [2024-10-12 01:02:09,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:09,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882757981] [2024-10-12 01:02:09,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:09,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:09,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:09,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:11,203 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 01:02:12,335 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:02:12,335 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:02:12,335 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:02:12,335 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:02:12,335 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:02:12,335 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:12,335 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:02:12,335 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:02:12,335 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration11_Lasso [2024-10-12 01:02:12,335 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:02:12,335 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:02:12,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:12,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:13,025 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:02:13,026 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:02:13,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,027 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 01:02:13,028 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 01:02:13,029 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 01:02:13,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,051 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 01:02:13,052 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 01:02:13,052 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 01:02:13,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,074 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 01:02:13,075 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 01:02:13,075 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 01:02:13,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,095 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 01:02:13,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,098 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 01:02:13,098 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 01:02:13,099 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 01:02:13,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,120 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 01:02:13,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,122 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 01:02:13,122 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 01:02:13,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 01:02:13,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-12 01:02:13,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,145 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 01:02:13,145 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 01:02:13,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 01:02:13,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,168 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 01:02:13,169 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 01:02:13,170 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 01:02:13,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,192 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 01:02:13,192 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 01:02:13,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 01:02:13,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,213 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 01:02:13,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,215 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 01:02:13,216 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 01:02:13,216 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 01:02:13,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,237 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 01:02:13,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,238 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 01:02:13,239 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 01:02:13,239 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 01:02:13,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,261 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 01:02:13,262 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 01:02:13,262 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 01:02:13,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,283 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 01:02:13,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,284 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 01:02:13,285 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 01:02:13,285 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 01:02:13,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,307 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 01:02:13,308 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 01:02:13,309 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 01:02:13,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,334 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 01:02:13,335 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 01:02:13,335 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 01:02:13,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,361 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 01:02:13,362 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 01:02:13,363 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 01:02:13,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,386 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 01:02:13,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,388 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 01:02:13,389 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 01:02:13,389 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 01:02:13,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:13,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:13,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:13,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,412 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 01:02:13,412 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 01:02:13,413 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 01:02:13,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,438 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 01:02:13,438 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 01:02:13,439 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 01:02:13,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,462 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 01:02:13,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,464 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 01:02:13,464 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 01:02:13,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:02:13,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,489 INFO L229 MonitoredProcess]: Starting monitored process 51 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 01:02:13,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-12 01:02:13,491 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 01:02:13,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,521 INFO L229 MonitoredProcess]: Starting monitored process 52 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 01:02:13,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-12 01:02:13,522 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 01:02:13,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:13,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,547 INFO L229 MonitoredProcess]: Starting monitored process 53 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 01:02:13,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-12 01:02:13,548 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 01:02:13,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-12 01:02:13,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,574 INFO L229 MonitoredProcess]: Starting monitored process 54 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 01:02:13,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-12 01:02:13,575 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 01:02:13,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-12 01:02:13,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,603 INFO L229 MonitoredProcess]: Starting monitored process 55 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 01:02:13,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-12 01:02:13,605 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 01:02:13,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-12 01:02:13,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,629 INFO L229 MonitoredProcess]: Starting monitored process 56 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 01:02:13,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-12 01:02:13,630 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 01:02:13,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-12 01:02:13,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,667 INFO L229 MonitoredProcess]: Starting monitored process 57 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 01:02:13,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-12 01:02:13,668 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 01:02:13,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:13,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-12 01:02:13,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,695 INFO L229 MonitoredProcess]: Starting monitored process 58 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 01:02:13,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-12 01:02:13,696 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 01:02:13,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:13,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:13,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:13,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:13,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:13,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:13,716 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:02:13,734 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-10-12 01:02:13,734 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 01:02:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:13,735 INFO L229 MonitoredProcess]: Starting monitored process 59 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 01:02:13,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-12 01:02:13,736 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:02:13,746 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2024-10-12 01:02:13,746 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:02:13,746 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1) = -2*v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1 + 11 Supporting invariants [-1*v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 + 1*v_rep(select (select #memory_int#2 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 >= 0, -1*v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1 + 1*v_rep(select (select #memory_int#2 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 >= 0] [2024-10-12 01:02:13,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-10-12 01:02:13,785 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2024-10-12 01:02:13,789 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 01:02:13,789 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-10-12 01:02:13,789 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-10-12 01:02:13,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 01:02:13,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:13,872 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 01:02:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-12 01:02:13,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:13,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-10-12 01:02:14,158 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 47 treesize of output 20 [2024-10-12 01:02:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-12 01:02:14,181 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 5 loop predicates [2024-10-12 01:02:14,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14 Second operand has 10 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 01:02:14,403 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14. Second operand has 10 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 254 states and 287 transitions. Complement of second has 26 states. [2024-10-12 01:02:14,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-12 01:02:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 01:02:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2024-10-12 01:02:14,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 6 letters. Loop has 39 letters. [2024-10-12 01:02:14,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:14,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 45 letters. Loop has 39 letters. [2024-10-12 01:02:14,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:14,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 6 letters. Loop has 78 letters. [2024-10-12 01:02:14,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:14,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 287 transitions. [2024-10-12 01:02:14,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-12 01:02:14,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 155 states and 182 transitions. [2024-10-12 01:02:14,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-10-12 01:02:14,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-10-12 01:02:14,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 182 transitions. [2024-10-12 01:02:14,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:02:14,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155 states and 182 transitions. [2024-10-12 01:02:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 182 transitions. [2024-10-12 01:02:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2024-10-12 01:02:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 80 states have (on average 1.125) internal successors, (90), 88 states have internal predecessors, (90), 26 states have call successors, (26), 16 states have call predecessors, (26), 36 states have return successors, (50), 37 states have call predecessors, (50), 18 states have call successors, (50) [2024-10-12 01:02:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2024-10-12 01:02:14,427 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-10-12 01:02:14,427 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-10-12 01:02:14,427 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 01:02:14,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 166 transitions. [2024-10-12 01:02:14,428 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-12 01:02:14,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:02:14,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:02:14,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:02:14,428 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 01:02:14,428 INFO L745 eck$LassoCheckResult]: Stem: 11253#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 11240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 11207#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 11209#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 11250#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 11228#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 11243#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 11226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 11217#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 11214#$Ultimate##0 [2024-10-12 01:02:14,428 INFO L747 eck$LassoCheckResult]: Loop: 11214#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 11216#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 11215#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 11214#$Ultimate##0 [2024-10-12 01:02:14,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:14,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1483069382, now seen corresponding path program 1 times [2024-10-12 01:02:14,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:14,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029277688] [2024-10-12 01:02:14,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:14,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:14,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:14,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:14,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 1 times [2024-10-12 01:02:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:14,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312589315] [2024-10-12 01:02:14,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:14,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:14,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:14,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:14,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash 208614944, now seen corresponding path program 1 times [2024-10-12 01:02:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063092402] [2024-10-12 01:02:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:14,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:14,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:15,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:15,867 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:02:15,867 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:02:15,867 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:02:15,867 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:02:15,867 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:02:15,867 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:15,867 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:02:15,867 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:02:15,867 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration12_Lasso [2024-10-12 01:02:15,867 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:02:15,868 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:02:15,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:15,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:16,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:16,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:16,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:16,394 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:02:16,394 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:02:16,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,396 INFO L229 MonitoredProcess]: Starting monitored process 60 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 01:02:16,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-12 01:02:16,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:02:16,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-12 01:02:16,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,422 INFO L229 MonitoredProcess]: Starting monitored process 61 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 01:02:16,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-12 01:02:16,424 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 01:02:16,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-12 01:02:16,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,447 INFO L229 MonitoredProcess]: Starting monitored process 62 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 01:02:16,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-12 01:02:16,448 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 01:02:16,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-12 01:02:16,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,471 INFO L229 MonitoredProcess]: Starting monitored process 63 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 01:02:16,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-12 01:02:16,472 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 01:02:16,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-12 01:02:16,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,499 INFO L229 MonitoredProcess]: Starting monitored process 64 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 01:02:16,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-12 01:02:16,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:02:16,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-12 01:02:16,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,522 INFO L229 MonitoredProcess]: Starting monitored process 65 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 01:02:16,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-12 01:02:16,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:02:16,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:16,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,545 INFO L229 MonitoredProcess]: Starting monitored process 66 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 01:02:16,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-12 01:02:16,547 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 01:02:16,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:16,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,568 INFO L229 MonitoredProcess]: Starting monitored process 67 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 01:02:16,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-12 01:02:16,570 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 01:02:16,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-10-12 01:02:16,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,592 INFO L229 MonitoredProcess]: Starting monitored process 68 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 01:02:16,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-12 01:02:16,594 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 01:02:16,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:16,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,617 INFO L229 MonitoredProcess]: Starting monitored process 69 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 01:02:16,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-12 01:02:16,618 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 01:02:16,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-12 01:02:16,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,640 INFO L229 MonitoredProcess]: Starting monitored process 70 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 01:02:16,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-12 01:02:16,642 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 01:02:16,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:16,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,664 INFO L229 MonitoredProcess]: Starting monitored process 71 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 01:02:16,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-12 01:02:16,666 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 01:02:16,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:16,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,688 INFO L229 MonitoredProcess]: Starting monitored process 72 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 01:02:16,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-12 01:02:16,691 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 01:02:16,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:16,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,714 INFO L229 MonitoredProcess]: Starting monitored process 73 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 01:02:16,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-12 01:02:16,715 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 01:02:16,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-10-12 01:02:16,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,738 INFO L229 MonitoredProcess]: Starting monitored process 74 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 01:02:16,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-12 01:02:16,740 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 01:02:16,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-10-12 01:02:16,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,763 INFO L229 MonitoredProcess]: Starting monitored process 75 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 01:02:16,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-12 01:02:16,764 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 01:02:16,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:16,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,786 INFO L229 MonitoredProcess]: Starting monitored process 76 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 01:02:16,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-12 01:02:16,787 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 01:02:16,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-10-12 01:02:16,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,810 INFO L229 MonitoredProcess]: Starting monitored process 77 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 01:02:16,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-10-12 01:02:16,811 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 01:02:16,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-10-12 01:02:16,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,834 INFO L229 MonitoredProcess]: Starting monitored process 78 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 01:02:16,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-10-12 01:02:16,835 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 01:02:16,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:16,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,856 INFO L229 MonitoredProcess]: Starting monitored process 79 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 01:02:16,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-10-12 01:02:16,857 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 01:02:16,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,868 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-10-12 01:02:16,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,878 INFO L229 MonitoredProcess]: Starting monitored process 80 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 01:02:16,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-10-12 01:02:16,880 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 01:02:16,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-10-12 01:02:16,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,902 INFO L229 MonitoredProcess]: Starting monitored process 81 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 01:02:16,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-10-12 01:02:16,903 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 01:02:16,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-10-12 01:02:16,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,925 INFO L229 MonitoredProcess]: Starting monitored process 82 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 01:02:16,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-10-12 01:02:16,926 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 01:02:16,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:16,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:16,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-10-12 01:02:16,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,949 INFO L229 MonitoredProcess]: Starting monitored process 83 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 01:02:16,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-10-12 01:02:16,950 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 01:02:16,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:16,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:16,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-10-12 01:02:16,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,974 INFO L229 MonitoredProcess]: Starting monitored process 84 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 01:02:16,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-12 01:02:16,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:02:16,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:16,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:16,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:16,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:16,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:16,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:16,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:16,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:16,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-10-12 01:02:16,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:16,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:16,997 INFO L229 MonitoredProcess]: Starting monitored process 85 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 01:02:16,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-10-12 01:02:16,998 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 01:02:17,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:17,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:17,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:17,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-10-12 01:02:17,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,020 INFO L229 MonitoredProcess]: Starting monitored process 86 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 01:02:17,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-10-12 01:02:17,022 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 01:02:17,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:17,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:17,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:17,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:17,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,045 INFO L229 MonitoredProcess]: Starting monitored process 87 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 01:02:17,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-10-12 01:02:17,046 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 01:02:17,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:17,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:17,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:17,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-10-12 01:02:17,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,068 INFO L229 MonitoredProcess]: Starting monitored process 88 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 01:02:17,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-10-12 01:02:17,069 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 01:02:17,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:17,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:17,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:17,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-10-12 01:02:17,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,091 INFO L229 MonitoredProcess]: Starting monitored process 89 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 01:02:17,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-10-12 01:02:17,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:02:17,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:17,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:17,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:17,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:17,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,115 INFO L229 MonitoredProcess]: Starting monitored process 90 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 01:02:17,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-10-12 01:02:17,116 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 01:02:17,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:17,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:17,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:17,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-10-12 01:02:17,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,138 INFO L229 MonitoredProcess]: Starting monitored process 91 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 01:02:17,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-10-12 01:02:17,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 01:02:17,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:17,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:17,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:17,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-10-12 01:02:17,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,161 INFO L229 MonitoredProcess]: Starting monitored process 92 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 01:02:17,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-10-12 01:02:17,162 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 01:02:17,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:17,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:17,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2024-10-12 01:02:17,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,185 INFO L229 MonitoredProcess]: Starting monitored process 93 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 01:02:17,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-10-12 01:02:17,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:02:17,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:17,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:17,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-10-12 01:02:17,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,209 INFO L229 MonitoredProcess]: Starting monitored process 94 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 01:02:17,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-10-12 01:02:17,210 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 01:02:17,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:17,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:17,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:17,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,234 INFO L229 MonitoredProcess]: Starting monitored process 95 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 01:02:17,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-10-12 01:02:17,235 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 01:02:17,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:17,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:17,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-10-12 01:02:17,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,259 INFO L229 MonitoredProcess]: Starting monitored process 96 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 01:02:17,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-10-12 01:02:17,260 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 01:02:17,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:17,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:17,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-10-12 01:02:17,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,284 INFO L229 MonitoredProcess]: Starting monitored process 97 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 01:02:17,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-10-12 01:02:17,285 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 01:02:17,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:17,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:17,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-10-12 01:02:17,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,308 INFO L229 MonitoredProcess]: Starting monitored process 98 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 01:02:17,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-10-12 01:02:17,309 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 01:02:17,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:17,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:17,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:17,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-10-12 01:02:17,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,332 INFO L229 MonitoredProcess]: Starting monitored process 99 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 01:02:17,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-10-12 01:02:17,333 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 01:02:17,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:17,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:17,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:17,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:17,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:17,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:17,353 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:02:17,360 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-12 01:02:17,361 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-12 01:02:17,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:17,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:17,362 INFO L229 MonitoredProcess]: Starting monitored process 100 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 01:02:17,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-10-12 01:02:17,363 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:02:17,373 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 01:02:17,373 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:02:17,373 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_1) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_1 + 11 Supporting invariants [] [2024-10-12 01:02:17,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:17,395 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-12 01:02:17,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-12 01:02:17,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-12 01:02:17,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-10-12 01:02:17,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:17,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 01:02:17,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:17,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 01:02:17,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:17,535 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 20 [2024-10-12 01:02:17,552 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 01:02:17,553 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2024-10-12 01:02:17,553 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34 Second operand has 10 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:02:17,682 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34. Second operand has 10 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 184 states and 223 transitions. Complement of second has 20 states. [2024-10-12 01:02:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 01:02:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:02:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-10-12 01:02:17,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2024-10-12 01:02:17,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:17,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2024-10-12 01:02:17,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:17,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2024-10-12 01:02:17,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:17,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 223 transitions. [2024-10-12 01:02:17,687 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-12 01:02:17,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 162 states and 200 transitions. [2024-10-12 01:02:17,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-12 01:02:17,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-10-12 01:02:17,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 200 transitions. [2024-10-12 01:02:17,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:02:17,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-10-12 01:02:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 200 transitions. [2024-10-12 01:02:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-12 01:02:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.118279569892473) internal successors, (104), 104 states have internal predecessors, (104), 31 states have call successors, (31), 20 states have call predecessors, (31), 38 states have return successors, (65), 37 states have call predecessors, (65), 23 states have call successors, (65) [2024-10-12 01:02:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2024-10-12 01:02:17,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-10-12 01:02:17,698 INFO L425 stractBuchiCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-10-12 01:02:17,698 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 01:02:17,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 200 transitions. [2024-10-12 01:02:17,699 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-12 01:02:17,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:02:17,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:02:17,700 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:02:17,700 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 01:02:17,700 INFO L745 eck$LassoCheckResult]: Stem: 11704#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 11688#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 11653#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 11655#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 11701#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 11693#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 11692#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 11694#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 11721#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 11757#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 11756#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 11726#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 11806#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 11742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 11727#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 11806#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 11742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 11727#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 11806#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 11742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 11727#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 11806#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 11742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 11727#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 11806#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 11742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 11727#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 11806#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 11804#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 11805#L25-1 assume true; 11807#func_to_recursive_line_23_to_23_0EXIT >#62#return; 11770#L25-1 assume true; 11749#func_to_recursive_line_23_to_23_0EXIT >#62#return; 11747#L25-1 assume true; 11739#func_to_recursive_line_23_to_23_0EXIT >#62#return; 11738#L25-1 assume true; 11737#func_to_recursive_line_23_to_23_0EXIT >#62#return; 11736#L25-1 assume true; 11735#func_to_recursive_line_23_to_23_0EXIT >#62#return; 11730#L25-1 assume true; 11725#func_to_recursive_line_23_to_23_0EXIT >#62#return; 11723#L25-1 assume true; 11720#func_to_recursive_line_23_to_23_0EXIT >#64#return; 11718#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 11673#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 11716#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 11672#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 11662#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 11660#$Ultimate##0 [2024-10-12 01:02:17,700 INFO L747 eck$LassoCheckResult]: Loop: 11660#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 11663#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 11661#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 11660#$Ultimate##0 [2024-10-12 01:02:17,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:17,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1721128109, now seen corresponding path program 2 times [2024-10-12 01:02:17,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:17,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141967958] [2024-10-12 01:02:17,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:17,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:17,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:17,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:17,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 2 times [2024-10-12 01:02:17,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:17,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358482560] [2024-10-12 01:02:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:17,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:17,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:17,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:17,739 INFO L85 PathProgramCache]: Analyzing trace with hash 807915725, now seen corresponding path program 3 times [2024-10-12 01:02:17,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:17,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827249521] [2024-10-12 01:02:17,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:17,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:17,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:17,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:20,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:20,580 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:02:20,580 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:02:20,580 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:02:20,580 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:02:20,580 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:02:20,580 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:20,580 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:02:20,580 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:02:20,580 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration13_Lasso [2024-10-12 01:02:20,581 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:02:20,581 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:02:20,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:20,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:21,134 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:02:21,134 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:02:21,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,135 INFO L229 MonitoredProcess]: Starting monitored process 101 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 01:02:21,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-10-12 01:02:21,137 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 01:02:21,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,159 INFO L229 MonitoredProcess]: Starting monitored process 102 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 01:02:21,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-10-12 01:02:21,161 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 01:02:21,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-10-12 01:02:21,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,183 INFO L229 MonitoredProcess]: Starting monitored process 103 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 01:02:21,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-10-12 01:02:21,184 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 01:02:21,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,207 INFO L229 MonitoredProcess]: Starting monitored process 104 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 01:02:21,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-10-12 01:02:21,208 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 01:02:21,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,230 INFO L229 MonitoredProcess]: Starting monitored process 105 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 01:02:21,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-10-12 01:02:21,232 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 01:02:21,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-10-12 01:02:21,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,254 INFO L229 MonitoredProcess]: Starting monitored process 106 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 01:02:21,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-10-12 01:02:21,255 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 01:02:21,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,278 INFO L229 MonitoredProcess]: Starting monitored process 107 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 01:02:21,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-10-12 01:02:21,280 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 01:02:21,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-10-12 01:02:21,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,306 INFO L229 MonitoredProcess]: Starting monitored process 108 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 01:02:21,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-10-12 01:02:21,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:02:21,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2024-10-12 01:02:21,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,329 INFO L229 MonitoredProcess]: Starting monitored process 109 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 01:02:21,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-10-12 01:02:21,331 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 01:02:21,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2024-10-12 01:02:21,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,354 INFO L229 MonitoredProcess]: Starting monitored process 110 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 01:02:21,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-10-12 01:02:21,355 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 01:02:21,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,381 INFO L229 MonitoredProcess]: Starting monitored process 111 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 01:02:21,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-10-12 01:02:21,383 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 01:02:21,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-10-12 01:02:21,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,406 INFO L229 MonitoredProcess]: Starting monitored process 112 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 01:02:21,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-10-12 01:02:21,407 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 01:02:21,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2024-10-12 01:02:21,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,430 INFO L229 MonitoredProcess]: Starting monitored process 113 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 01:02:21,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-10-12 01:02:21,431 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 01:02:21,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2024-10-12 01:02:21,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,454 INFO L229 MonitoredProcess]: Starting monitored process 114 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 01:02:21,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-10-12 01:02:21,455 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 01:02:21,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:21,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:21,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2024-10-12 01:02:21,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,480 INFO L229 MonitoredProcess]: Starting monitored process 115 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 01:02:21,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-10-12 01:02:21,482 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 01:02:21,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:21,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:21,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-10-12 01:02:21,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,505 INFO L229 MonitoredProcess]: Starting monitored process 116 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 01:02:21,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-10-12 01:02:21,507 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 01:02:21,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,532 INFO L229 MonitoredProcess]: Starting monitored process 117 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 01:02:21,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-10-12 01:02:21,533 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 01:02:21,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-10-12 01:02:21,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,556 INFO L229 MonitoredProcess]: Starting monitored process 118 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 01:02:21,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-10-12 01:02:21,557 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 01:02:21,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,579 INFO L229 MonitoredProcess]: Starting monitored process 119 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 01:02:21,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-10-12 01:02:21,580 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 01:02:21,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,602 INFO L229 MonitoredProcess]: Starting monitored process 120 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 01:02:21,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-10-12 01:02:21,603 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 01:02:21,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-10-12 01:02:21,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,625 INFO L229 MonitoredProcess]: Starting monitored process 121 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 01:02:21,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-10-12 01:02:21,627 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 01:02:21,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-10-12 01:02:21,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,649 INFO L229 MonitoredProcess]: Starting monitored process 122 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 01:02:21,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-10-12 01:02:21,650 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 01:02:21,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-10-12 01:02:21,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,673 INFO L229 MonitoredProcess]: Starting monitored process 123 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 01:02:21,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-10-12 01:02:21,674 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 01:02:21,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-10-12 01:02:21,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,697 INFO L229 MonitoredProcess]: Starting monitored process 124 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 01:02:21,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-10-12 01:02:21,699 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 01:02:21,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:21,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:21,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:21,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,721 INFO L229 MonitoredProcess]: Starting monitored process 125 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 01:02:21,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-10-12 01:02:21,722 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 01:02:21,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:21,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:21,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2024-10-12 01:02:21,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,748 INFO L229 MonitoredProcess]: Starting monitored process 126 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 01:02:21,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-10-12 01:02:21,749 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 01:02:21,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:21,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:21,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,774 INFO L229 MonitoredProcess]: Starting monitored process 127 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 01:02:21,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-10-12 01:02:21,777 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 01:02:21,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:21,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:21,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:21,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,801 INFO L229 MonitoredProcess]: Starting monitored process 128 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 01:02:21,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-10-12 01:02:21,803 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 01:02:21,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:21,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:21,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:21,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:21,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:21,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:21,823 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:02:21,836 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-12 01:02:21,836 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 01:02:21,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:21,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:21,837 INFO L229 MonitoredProcess]: Starting monitored process 129 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 01:02:21,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-10-12 01:02:21,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:02:21,848 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 01:02:21,848 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:02:21,848 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_2) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_2 + 11 Supporting invariants [] [2024-10-12 01:02:21,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:21,869 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-12 01:02:21,870 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-12 01:02:21,870 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-12 01:02:21,870 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-10-12 01:02:21,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:21,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 01:02:21,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:22,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 01:02:22,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:22,275 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 20 [2024-10-12 01:02:22,288 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 01:02:22,289 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-12 01:02:22,289 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 01:02:22,362 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 176 states and 214 transitions. Complement of second has 16 states. [2024-10-12 01:02:22,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 01:02:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 01:02:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-12 01:02:22,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2024-10-12 01:02:22,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:22,364 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 01:02:22,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:22,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 01:02:22,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:22,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 01:02:22,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:22,740 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 20 [2024-10-12 01:02:22,754 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 01:02:22,755 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-12 01:02:22,755 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 01:02:22,816 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 176 states and 214 transitions. Complement of second has 16 states. [2024-10-12 01:02:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 01:02:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 01:02:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-12 01:02:22,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2024-10-12 01:02:22,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:22,819 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 01:02:22,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:22,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 01:02:22,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 01:02:23,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:23,182 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 20 [2024-10-12 01:02:23,197 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 01:02:23,197 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-12 01:02:23,197 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 01:02:23,287 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 223 states and 275 transitions. Complement of second has 17 states. [2024-10-12 01:02:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 01:02:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 01:02:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2024-10-12 01:02:23,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 48 letters. Loop has 3 letters. [2024-10-12 01:02:23,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:23,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 51 letters. Loop has 3 letters. [2024-10-12 01:02:23,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:23,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 48 letters. Loop has 6 letters. [2024-10-12 01:02:23,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:23,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 275 transitions. [2024-10-12 01:02:23,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 01:02:23,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 129 states and 159 transitions. [2024-10-12 01:02:23,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-12 01:02:23,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-10-12 01:02:23,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 159 transitions. [2024-10-12 01:02:23,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:02:23,292 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 159 transitions. [2024-10-12 01:02:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 159 transitions. [2024-10-12 01:02:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2024-10-12 01:02:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 68 states have (on average 1.088235294117647) internal successors, (74), 74 states have internal predecessors, (74), 21 states have call successors, (21), 13 states have call predecessors, (21), 29 states have return successors, (46), 30 states have call predecessors, (46), 17 states have call successors, (46) [2024-10-12 01:02:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2024-10-12 01:02:23,303 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 141 transitions. [2024-10-12 01:02:23,303 INFO L425 stractBuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2024-10-12 01:02:23,303 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-12 01:02:23,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 141 transitions. [2024-10-12 01:02:23,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 01:02:23,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:02:23,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:02:23,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:02:23,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:02:23,307 INFO L745 eck$LassoCheckResult]: Stem: 13011#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 12995#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 12961#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 12963#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 13008#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 13002#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 13001#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 13003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 13042#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13048#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 13077#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12969#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12970#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12997#L25-1 assume true; 12998#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13063#L25-1 assume true; 13062#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13061#L25-1 assume true; 13060#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13059#L25-1 assume true; 13058#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13057#L25-1 assume true; 13056#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13053#L25-1 assume true; 13052#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13049#L25-1 assume true; 13046#func_to_recursive_line_23_to_23_0EXIT >#64#return; 13047#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 12973#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 12986#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 12983#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 12984#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13048#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 13077#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12969#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12970#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12997#L25-1 assume true; 12998#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13063#L25-1 assume true; 13062#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13061#L25-1 assume true; 13060#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13059#L25-1 assume true; 13058#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13057#L25-1 assume true; 13056#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13053#L25-1 assume true; 13052#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13049#L25-1 assume true; 13046#func_to_recursive_line_23_to_23_0EXIT >#64#return; 13045#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 12974#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 12986#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 12983#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 12984#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13048#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 13077#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12969#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12970#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12997#L25-1 assume true; 12998#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13063#L25-1 assume true; 13062#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13061#L25-1 assume true; 13060#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13059#L25-1 assume true; 13058#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13057#L25-1 assume true; 13056#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13053#L25-1 assume true; 13052#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13049#L25-1 assume true; 13046#func_to_recursive_line_23_to_23_0EXIT >#64#return; 13045#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 12974#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 12986#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 12983#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 12984#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13048#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 13077#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12969#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12970#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12997#L25-1 assume true; 12998#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13063#L25-1 assume true; 13062#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13061#L25-1 assume true; 13060#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13059#L25-1 assume true; 13058#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13057#L25-1 assume true; 13056#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13053#L25-1 assume true; 13052#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13049#L25-1 assume true; 13046#func_to_recursive_line_23_to_23_0EXIT >#64#return; 13045#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 12974#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 12986#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 12983#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 12984#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13048#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 13077#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12969#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12970#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12997#L25-1 assume true; 12998#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13063#L25-1 assume true; 13062#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13061#L25-1 assume true; 13060#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13059#L25-1 assume true; 13058#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13057#L25-1 assume true; 13056#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13053#L25-1 assume true; 13052#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13049#L25-1 assume true; 13046#func_to_recursive_line_23_to_23_0EXIT >#64#return; 13045#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 12974#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 12986#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 12983#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 12984#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13048#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 13077#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12969#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12971#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12968#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12967#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12970#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12997#L25-1 assume true; 12998#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13063#L25-1 assume true; 13062#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13061#L25-1 assume true; 13060#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13059#L25-1 assume true; 13058#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13057#L25-1 assume true; 13056#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13053#L25-1 assume true; 13052#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13049#L25-1 assume true; 13046#func_to_recursive_line_23_to_23_0EXIT >#64#return; 13045#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 12974#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 12986#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 13041#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12972#L41-1 assume true; 12975#func_to_recursive_line_22_to_23_0EXIT >#66#return; 13000#L41-1 assume true; 13037#func_to_recursive_line_22_to_23_0EXIT >#66#return; 13036#L41-1 assume true; 13035#func_to_recursive_line_22_to_23_0EXIT >#66#return; 13034#L41-1 assume true; 13033#func_to_recursive_line_22_to_23_0EXIT >#66#return; 13032#L41-1 assume true; 13031#func_to_recursive_line_22_to_23_0EXIT >#66#return; 13030#L41-1 assume true; 13029#func_to_recursive_line_22_to_23_0EXIT >#66#return; 13028#L41-1 assume true; 13026#func_to_recursive_line_22_to_23_0EXIT >#70#return; 13012#L67-1 call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 12960#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 12962#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4); 13010#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 12977#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 12985#$Ultimate##0 [2024-10-12 01:02:23,307 INFO L747 eck$LassoCheckResult]: Loop: 12985#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 12982#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 12965#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 12964#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12966#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12988#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13013#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 13014#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12989#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13013#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 13014#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12989#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13013#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 13014#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12989#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13013#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 13014#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12989#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13013#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 13014#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 12989#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 13013#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 12999#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12996#L25-1 assume true; 12987#func_to_recursive_line_23_to_23_0EXIT >#62#return; 12990#L25-1 assume true; 13025#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13024#L25-1 assume true; 13023#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13022#L25-1 assume true; 13021#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13020#L25-1 assume true; 13019#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13018#L25-1 assume true; 13017#func_to_recursive_line_23_to_23_0EXIT >#62#return; 13016#L25-1 assume true; 13015#func_to_recursive_line_23_to_23_0EXIT >#64#return; 12976#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 12978#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 12985#$Ultimate##0 [2024-10-12 01:02:23,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:23,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1634781349, now seen corresponding path program 2 times [2024-10-12 01:02:23,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:23,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123004599] [2024-10-12 01:02:23,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:23,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:23,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:23,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:23,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1388529776, now seen corresponding path program 2 times [2024-10-12 01:02:23,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:23,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246299498] [2024-10-12 01:02:23,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:23,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:23,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:23,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:23,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:23,438 INFO L85 PathProgramCache]: Analyzing trace with hash -350990602, now seen corresponding path program 3 times [2024-10-12 01:02:23,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:23,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983198779] [2024-10-12 01:02:23,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:23,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:23,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:24,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2024-10-12 01:02:34,810 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:02:34,810 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:02:34,810 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:02:34,810 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:02:34,810 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:02:34,810 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:34,810 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:02:34,810 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:02:34,811 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration14_Lasso [2024-10-12 01:02:34,811 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:02:34,811 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:02:34,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:34,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:34,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:02:35,509 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:02:35,509 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:02:35,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,511 INFO L229 MonitoredProcess]: Starting monitored process 130 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 01:02:35,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-10-12 01:02:35,514 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 01:02:35,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:35,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:35,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:35,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2024-10-12 01:02:35,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,536 INFO L229 MonitoredProcess]: Starting monitored process 131 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 01:02:35,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-10-12 01:02:35,537 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 01:02:35,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:02:35,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:02:35,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:02:35,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-10-12 01:02:35,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,559 INFO L229 MonitoredProcess]: Starting monitored process 132 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 01:02:35,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-10-12 01:02:35,561 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 01:02:35,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:35,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:35,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:35,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,584 INFO L229 MonitoredProcess]: Starting monitored process 133 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 01:02:35,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-10-12 01:02:35,585 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 01:02:35,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:35,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:35,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2024-10-12 01:02:35,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,611 INFO L229 MonitoredProcess]: Starting monitored process 134 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 01:02:35,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-10-12 01:02:35,612 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 01:02:35,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:35,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:35,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2024-10-12 01:02:35,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,636 INFO L229 MonitoredProcess]: Starting monitored process 135 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 01:02:35,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-10-12 01:02:35,637 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 01:02:35,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:35,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:35,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:35,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,661 INFO L229 MonitoredProcess]: Starting monitored process 136 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 01:02:35,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-10-12 01:02:35,662 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 01:02:35,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:35,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:35,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2024-10-12 01:02:35,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,687 INFO L229 MonitoredProcess]: Starting monitored process 137 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 01:02:35,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-10-12 01:02:35,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 01:02:35,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:35,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:35,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:35,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,714 INFO L229 MonitoredProcess]: Starting monitored process 138 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 01:02:35,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-10-12 01:02:35,715 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 01:02:35,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:35,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:35,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-10-12 01:02:35,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,740 INFO L229 MonitoredProcess]: Starting monitored process 139 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 01:02:35,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-10-12 01:02:35,741 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 01:02:35,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:35,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:35,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-10-12 01:02:35,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,764 INFO L229 MonitoredProcess]: Starting monitored process 140 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 01:02:35,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-10-12 01:02:35,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 01:02:35,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:35,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:35,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2024-10-12 01:02:35,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,789 INFO L229 MonitoredProcess]: Starting monitored process 141 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 01:02:35,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2024-10-12 01:02:35,790 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 01:02:35,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:35,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:35,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:02:35,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:35,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,814 INFO L229 MonitoredProcess]: Starting monitored process 142 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 01:02:35,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2024-10-12 01:02:35,816 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 01:02:35,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:02:35,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:02:35,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:02:35,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:02:35,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 01:02:35,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 01:02:35,835 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:02:35,848 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-12 01:02:35,848 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-12 01:02:35,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:02:35,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,849 INFO L229 MonitoredProcess]: Starting monitored process 143 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 01:02:35,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-10-12 01:02:35,850 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:02:35,860 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 01:02:35,860 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:02:35,860 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_2) = -2*v_rep(select (select #memory_int#2 func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_2 + 11 Supporting invariants [] [2024-10-12 01:02:35,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2024-10-12 01:02:35,894 INFO L156 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2024-10-12 01:02:35,895 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 01:02:35,895 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 01:02:35,895 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-12 01:02:35,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:36,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-12 01:02:36,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:36,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2024-10-12 01:02:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:37,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 01:02:37,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:37,916 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 47 treesize of output 20 [2024-10-12 01:02:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-12 01:02:37,930 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2024-10-12 01:02:37,930 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 01:02:38,064 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 150 states and 176 transitions. Complement of second has 23 states. [2024-10-12 01:02:38,065 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 01:02:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 01:02:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2024-10-12 01:02:38,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2024-10-12 01:02:38,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:38,067 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 01:02:38,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:38,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-12 01:02:38,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:40,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 01:02:40,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:40,319 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 47 treesize of output 20 [2024-10-12 01:02:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-12 01:02:40,333 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2024-10-12 01:02:40,333 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 01:02:40,438 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 150 states and 176 transitions. Complement of second has 23 states. [2024-10-12 01:02:40,439 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 01:02:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 01:02:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2024-10-12 01:02:40,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2024-10-12 01:02:40,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:40,440 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 01:02:40,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:40,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-12 01:02:40,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:42,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 01:02:42,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:42,477 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 47 treesize of output 20 [2024-10-12 01:02:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-12 01:02:42,494 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2024-10-12 01:02:42,494 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 01:02:42,637 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 225 states and 258 transitions. Complement of second has 23 states. [2024-10-12 01:02:42,637 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 01:02:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 01:02:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2024-10-12 01:02:42,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 261 letters. Loop has 39 letters. [2024-10-12 01:02:42,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:42,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 300 letters. Loop has 39 letters. [2024-10-12 01:02:42,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:42,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 261 letters. Loop has 78 letters. [2024-10-12 01:02:42,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:02:42,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 258 transitions. [2024-10-12 01:02:42,642 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 01:02:42,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 0 states and 0 transitions. [2024-10-12 01:02:42,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 01:02:42,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 01:02:42,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 01:02:42,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:02:42,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 01:02:42,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 01:02:42,642 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 01:02:42,642 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-12 01:02:42,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 01:02:42,642 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 01:02:42,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 01:02:42,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 01:02:42 BoogieIcfgContainer [2024-10-12 01:02:42,647 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 01:02:42,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 01:02:42,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 01:02:42,648 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 01:02:42,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:01:30" (3/4) ... [2024-10-12 01:02:42,650 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 01:02:42,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 01:02:42,651 INFO L158 Benchmark]: Toolchain (without parser) took 72742.44ms. Allocated memory was 197.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 129.7MB in the beginning and 938.3MB in the end (delta: -808.5MB). Peak memory consumption was 412.5MB. Max. memory is 16.1GB. [2024-10-12 01:02:42,651 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 01:02:42,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.97ms. Allocated memory is still 197.1MB. Free memory was 129.5MB in the beginning and 117.7MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 01:02:42,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.46ms. Allocated memory is still 197.1MB. Free memory was 117.7MB in the beginning and 116.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 01:02:42,651 INFO L158 Benchmark]: Boogie Preprocessor took 49.42ms. Allocated memory is still 197.1MB. Free memory was 116.2MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 01:02:42,652 INFO L158 Benchmark]: RCFGBuilder took 367.04ms. Allocated memory is still 197.1MB. Free memory was 114.0MB in the beginning and 98.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 01:02:42,652 INFO L158 Benchmark]: BuchiAutomizer took 72080.18ms. Allocated memory was 197.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 98.0MB in the beginning and 938.3MB in the end (delta: -840.3MB). Peak memory consumption was 381.1MB. Max. memory is 16.1GB. [2024-10-12 01:02:42,652 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 1.4GB. Free memory is still 938.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 01:02:42,653 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.12ms. Allocated memory is still 104.9MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.97ms. Allocated memory is still 197.1MB. Free memory was 129.5MB in the beginning and 117.7MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.46ms. Allocated memory is still 197.1MB. Free memory was 117.7MB in the beginning and 116.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.42ms. Allocated memory is still 197.1MB. Free memory was 116.2MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 367.04ms. Allocated memory is still 197.1MB. Free memory was 114.0MB in the beginning and 98.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 72080.18ms. Allocated memory was 197.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 98.0MB in the beginning and 938.3MB in the end (delta: -840.3MB). Peak memory consumption was 381.1MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 1.4GB. Free memory is still 938.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (9 trivial, 3 deterministic, 2 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 11 locations. One deterministic module has affine ranking function null and consists of 11 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 8 locations. 9 modules have a trivial ranking function, the largest among these consists of 45 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 72.0s and 15 iterations. TraceHistogramMax:42. Analysis of lassos took 58.4s. Construction of modules took 1.5s. Büchi inclusion checks took 11.8s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4401/4401 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 620 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 603 mSDsluCounter, 1227 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 955 mSDsCounter, 548 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2416 IncrementalHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 548 mSolverCounterUnsat, 272 mSDtfsCounter, 2416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital271 mio100 ax100 hnf100 lsp94 ukn66 mio100 lsp21 div100 bol100 ite100 ukn100 eq215 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 01:02:42,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:42,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 01:02:43,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 01:02:43,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 01:02:43,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 01:02:43,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 01:02:43,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 01:02:44,099 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