./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya --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.4-dev-0e0057c [2023-11-29 06:12:17,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:12:17,149 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-29 06:12:17,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:12:17,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:12:17,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:12:17,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:12:17,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:12:17,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:12:17,194 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:12:17,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:12:17,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:12:17,196 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:12:17,197 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 06:12:17,197 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 06:12:17,198 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 06:12:17,199 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 06:12:17,199 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 06:12:17,200 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 06:12:17,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:12:17,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 06:12:17,202 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:12:17,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:12:17,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:12:17,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:12:17,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 06:12:17,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 06:12:17,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 06:12:17,205 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:12:17,206 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:12:17,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:12:17,207 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 06:12:17,207 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:12:17,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:12:17,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:12:17,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:12:17,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:12:17,210 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 06:12:17,210 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya 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 [2023-11-29 06:12:17,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:12:17,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:12:17,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:12:17,524 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:12:17,524 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:12:17,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-29 06:12:20,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:12:21,033 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:12:21,034 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-29 06:12:21,042 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/data/fa3a1d372/379e963c71644320bb8d9802fab5ea56/FLAGaa0cc180a [2023-11-29 06:12:21,057 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/data/fa3a1d372/379e963c71644320bb8d9802fab5ea56 [2023-11-29 06:12:21,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:12:21,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:12:21,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:12:21,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:12:21,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:12:21,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb8843a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21, skipping insertion in model container [2023-11-29 06:12:21,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,094 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:12:21,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:12:21,258 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:12:21,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:12:21,295 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:12:21,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21 WrapperNode [2023-11-29 06:12:21,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:12:21,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:12:21,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:12:21,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:12:21,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,331 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2023-11-29 06:12:21,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:12:21,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:12:21,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:12:21,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:12:21,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,369 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]. [2023-11-29 06:12:21,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:12:21,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:12:21,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:12:21,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:12:21,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (1/1) ... [2023-11-29 06:12:21,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:12:21,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:12:21,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:12:21,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 06:12:21,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:12:21,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:12:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:12:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:12:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:12:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:12:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:12:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:12:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:12:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:12:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2023-11-29 06:12:21,483 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2023-11-29 06:12:21,484 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-29 06:12:21,484 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-29 06:12:21,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:12:21,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:12:21,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:12:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:12:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:12:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 06:12:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2023-11-29 06:12:21,485 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2023-11-29 06:12:21,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:12:21,598 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:12:21,601 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:12:21,815 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:12:21,826 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:12:21,827 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 06:12:21,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:12:21 BoogieIcfgContainer [2023-11-29 06:12:21,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:12:21,830 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 06:12:21,831 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 06:12:21,836 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 06:12:21,837 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 06:12:21,837 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 06:12:21" (1/3) ... [2023-11-29 06:12:21,839 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1278ce84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:12:21, skipping insertion in model container [2023-11-29 06:12:21,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 06:12:21,839 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:12:21" (2/3) ... [2023-11-29 06:12:21,840 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1278ce84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:12:21, skipping insertion in model container [2023-11-29 06:12:21,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 06:12:21,840 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:12:21" (3/3) ... [2023-11-29 06:12:21,842 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_3.c [2023-11-29 06:12:21,903 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 06:12:21,903 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 06:12:21,904 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 06:12:21,904 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 06:12:21,904 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 06:12:21,904 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 06:12:21,904 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 06:12:21,904 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 06:12:21,909 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) [2023-11-29 06:12:21,931 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:21,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:12:21,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:12:21,938 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 06:12:21,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:12:21,939 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 06:12:21,939 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) [2023-11-29 06:12:21,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:21,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:12:21,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:12:21,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 06:12:21,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:12:21,953 INFO L748 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#2(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#1(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#2(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 [2023-11-29 06:12:21,953 INFO L750 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#2(~a.base, ~a.offset, 4); 16#L61true assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(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#1(~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#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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 [2023-11-29 06:12:21,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 1 times [2023-11-29 06:12:21,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:21,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058086341] [2023-11-29 06:12:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:22,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:12:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:22,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:12:22,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:22,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1113047060, now seen corresponding path program 1 times [2023-11-29 06:12:22,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:22,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036094582] [2023-11-29 06:12:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:22,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:22,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:12:22,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:12:22,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036094582] [2023-11-29 06:12:22,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036094582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:12:22,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:12:22,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:12:22,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108183738] [2023-11-29 06:12:22,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:12:22,616 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:12:22,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:12:22,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:12:22,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:12:22,654 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) [2023-11-29 06:12:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:12:22,843 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2023-11-29 06:12:22,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2023-11-29 06:12:22,849 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:22,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 24 states and 29 transitions. [2023-11-29 06:12:22,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-11-29 06:12:22,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-11-29 06:12:22,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2023-11-29 06:12:22,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:12:22,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-11-29 06:12:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2023-11-29 06:12:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-11-29 06:12:22,889 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) [2023-11-29 06:12:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-11-29 06:12:22,892 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-11-29 06:12:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:12:22,898 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-11-29 06:12:22,898 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 06:12:22,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2023-11-29 06:12:22,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:22,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:12:22,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:12:22,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 06:12:22,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:12:22,901 INFO L748 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#2(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#1(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#2(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 [2023-11-29 06:12:22,902 INFO L750 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#2(~a.base, ~a.offset, 4); 107#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(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#1(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~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#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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 [2023-11-29 06:12:22,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:22,903 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 2 times [2023-11-29 06:12:22,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:22,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597741146] [2023-11-29 06:12:22,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:22,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:22,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:12:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:22,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:12:22,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:22,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1122494970, now seen corresponding path program 1 times [2023-11-29 06:12:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:22,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070616094] [2023-11-29 06:12:22,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:22,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:23,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:23,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:23,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:12:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 06:12:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:12:23,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070616094] [2023-11-29 06:12:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070616094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:12:23,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:12:23,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:12:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597763650] [2023-11-29 06:12:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:12:23,278 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:12:23,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:12:23,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:12:23,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:12:23,279 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) [2023-11-29 06:12:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:12:23,412 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2023-11-29 06:12:23,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2023-11-29 06:12:23,414 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:23,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2023-11-29 06:12:23,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-11-29 06:12:23,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-11-29 06:12:23,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2023-11-29 06:12:23,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:12:23,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-29 06:12:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2023-11-29 06:12:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 06:12:23,422 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) [2023-11-29 06:12:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-29 06:12:23,424 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-29 06:12:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:12:23,425 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-29 06:12:23,426 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 06:12:23,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2023-11-29 06:12:23,427 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:23,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:12:23,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:12:23,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 06:12:23,428 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] [2023-11-29 06:12:23,429 INFO L748 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#2(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#1(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#2(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 [2023-11-29 06:12:23,429 INFO L750 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#2(~a.base, ~a.offset, 4); 191#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(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#1(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~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#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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 [2023-11-29 06:12:23,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 3 times [2023-11-29 06:12:23,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:23,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279853879] [2023-11-29 06:12:23,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:23,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:12:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:23,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:12:23,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1944809856, now seen corresponding path program 1 times [2023-11-29 06:12:23,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:23,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672988937] [2023-11-29 06:12:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:23,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:23,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:24,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:24,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:12:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 06:12:24,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:12:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672988937] [2023-11-29 06:12:24,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672988937] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:12:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856767231] [2023-11-29 06:12:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:24,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:12:24,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:12:24,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:12:24,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:12:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:24,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 06:12:24,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:12:24,343 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 [2023-11-29 06:12:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 06:12:24,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:12:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 06:12:25,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856767231] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:12:25,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:12:25,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2023-11-29 06:12:25,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958387382] [2023-11-29 06:12:25,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:12:25,284 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:12:25,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:12:25,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 06:12:25,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2023-11-29 06:12:25,286 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 24 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 20 states have internal predecessors, (32), 8 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 06:12:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:12:25,684 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-11-29 06:12:25,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2023-11-29 06:12:25,686 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:25,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2023-11-29 06:12:25,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-11-29 06:12:25,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-11-29 06:12:25,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2023-11-29 06:12:25,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:12:25,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-29 06:12:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2023-11-29 06:12:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 06:12:25,692 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) [2023-11-29 06:12:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-11-29 06:12:25,694 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-29 06:12:25,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:12:25,695 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-29 06:12:25,695 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 06:12:25,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2023-11-29 06:12:25,696 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:25,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:12:25,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:12:25,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 06:12:25,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:12:25,698 INFO L748 eck$LassoCheckResult]: Stem: 464#$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); 458#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#2(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#1(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 445#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);< 446#$Ultimate##0 [2023-11-29 06:12:25,699 INFO L750 eck$LassoCheckResult]: Loop: 446#$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#2(~a.base, ~a.offset, 4); 463#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 448#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 457#$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#1(~b.base, ~b.offset, 4); 455#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 452#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 451#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 454#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; 453#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 451#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 454#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; 453#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 451#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 454#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; 453#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 451#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 454#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 461#L25-1 assume true; 459#func_to_recursive_line_23_to_23_0EXIT >#62#return; 460#L25-1 assume true; 471#func_to_recursive_line_23_to_23_0EXIT >#62#return; 470#L25-1 assume true; 469#func_to_recursive_line_23_to_23_0EXIT >#62#return; 468#L25-1 assume true; 467#func_to_recursive_line_23_to_23_0EXIT >#64#return; 456#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 449#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 457#$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#1(~b.base, ~b.offset, 4); 455#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 447#L41-1 assume true; 450#func_to_recursive_line_22_to_23_0EXIT >#66#return; 462#L41-1 assume true; 466#func_to_recursive_line_22_to_23_0EXIT >#70#return; 465#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 444#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 446#$Ultimate##0 [2023-11-29 06:12:25,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:25,699 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 4 times [2023-11-29 06:12:25,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:25,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287768041] [2023-11-29 06:12:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:25,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:25,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:12:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:25,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:12:25,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:25,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1667775892, now seen corresponding path program 2 times [2023-11-29 06:12:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:25,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436035749] [2023-11-29 06:12:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:26,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:26,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:26,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:27,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:27,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 06:12:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 06:12:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:12:27,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436035749] [2023-11-29 06:12:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436035749] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:12:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947237560] [2023-11-29 06:12:27,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:12:27,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:12:27,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:12:27,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:12:27,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:12:27,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:12:27,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:12:27,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 06:12:27,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:12:27,406 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 [2023-11-29 06:12:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 06:12:27,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:12:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 06:12:28,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947237560] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:12:28,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:12:28,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 29 [2023-11-29 06:12:28,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015438280] [2023-11-29 06:12:28,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:12:28,231 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:12:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:12:28,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 06:12:28,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2023-11-29 06:12:28,233 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 29 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 24 states have internal predecessors, (39), 11 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:12:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:12:28,835 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-11-29 06:12:28,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2023-11-29 06:12:28,837 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:28,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2023-11-29 06:12:28,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2023-11-29 06:12:28,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-11-29 06:12:28,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2023-11-29 06:12:28,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:12:28,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-29 06:12:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2023-11-29 06:12:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 06:12:28,844 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) [2023-11-29 06:12:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-29 06:12:28,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-29 06:12:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 06:12:28,847 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-29 06:12:28,847 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 06:12:28,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2023-11-29 06:12:28,849 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:28,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:12:28,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:12:28,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 06:12:28,852 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] [2023-11-29 06:12:28,852 INFO L748 eck$LassoCheckResult]: Stem: 863#$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); 857#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#2(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#1(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 844#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);< 845#$Ultimate##0 [2023-11-29 06:12:28,853 INFO L750 eck$LassoCheckResult]: Loop: 845#$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#2(~a.base, ~a.offset, 4); 862#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 848#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 856#$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#1(~b.base, ~b.offset, 4); 855#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 851#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 850#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 853#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; 852#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 850#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 853#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; 852#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 850#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 853#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; 852#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 850#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 853#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; 852#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 850#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 853#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 860#L25-1 assume true; 858#func_to_recursive_line_23_to_23_0EXIT >#62#return; 859#L25-1 assume true; 874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 873#L25-1 assume true; 872#func_to_recursive_line_23_to_23_0EXIT >#62#return; 871#L25-1 assume true; 870#func_to_recursive_line_23_to_23_0EXIT >#62#return; 869#L25-1 assume true; 868#func_to_recursive_line_23_to_23_0EXIT >#64#return; 854#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 847#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 856#$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#1(~b.base, ~b.offset, 4); 855#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 851#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 850#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 853#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; 852#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 850#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 853#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; 852#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 850#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 853#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; 852#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 850#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 853#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; 852#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 850#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 853#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 860#L25-1 assume true; 858#func_to_recursive_line_23_to_23_0EXIT >#62#return; 859#L25-1 assume true; 874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 873#L25-1 assume true; 872#func_to_recursive_line_23_to_23_0EXIT >#62#return; 871#L25-1 assume true; 870#func_to_recursive_line_23_to_23_0EXIT >#62#return; 869#L25-1 assume true; 868#func_to_recursive_line_23_to_23_0EXIT >#64#return; 854#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 847#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 856#$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#1(~b.base, ~b.offset, 4); 855#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 846#L41-1 assume true; 849#func_to_recursive_line_22_to_23_0EXIT >#66#return; 861#L41-1 assume true; 867#func_to_recursive_line_22_to_23_0EXIT >#66#return; 866#L41-1 assume true; 865#func_to_recursive_line_22_to_23_0EXIT >#70#return; 864#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 843#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 845#$Ultimate##0 [2023-11-29 06:12:28,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:28,853 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 5 times [2023-11-29 06:12:28,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:28,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711133512] [2023-11-29 06:12:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:28,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:28,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:12:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:28,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:12:28,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash -909942614, now seen corresponding path program 3 times [2023-11-29 06:12:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:28,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546470808] [2023-11-29 06:12:28,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:28,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:30,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:30,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:30,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:30,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:30,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 06:12:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:30,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:30,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:31,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:31,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:31,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 06:12:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 10 proven. 118 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-11-29 06:12:31,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:12:31,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546470808] [2023-11-29 06:12:31,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546470808] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:12:31,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061129241] [2023-11-29 06:12:31,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:12:31,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:12:31,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:12:31,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:12:31,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:12:31,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 06:12:31,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:12:31,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 06:12:31,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:12:31,204 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 [2023-11-29 06:12:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2023-11-29 06:12:31,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:12:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2023-11-29 06:12:32,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061129241] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:12:32,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:12:32,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 35 [2023-11-29 06:12:32,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689109361] [2023-11-29 06:12:32,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:12:32,540 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:12:32,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:12:32,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 06:12:32,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 06:12:32,543 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) [2023-11-29 06:12:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:12:33,302 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2023-11-29 06:12:33,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2023-11-29 06:12:33,304 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:33,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2023-11-29 06:12:33,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2023-11-29 06:12:33,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2023-11-29 06:12:33,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2023-11-29 06:12:33,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:12:33,308 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-29 06:12:33,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2023-11-29 06:12:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-29 06:12:33,313 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) [2023-11-29 06:12:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-29 06:12:33,314 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-29 06:12:33,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 06:12:33,315 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-29 06:12:33,316 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 06:12:33,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2023-11-29 06:12:33,317 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:33,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:12:33,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:12:33,321 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 06:12:33,322 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] [2023-11-29 06:12:33,322 INFO L748 eck$LassoCheckResult]: Stem: 1658#$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); 1654#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#2(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#1(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1639#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);< 1640#$Ultimate##0 [2023-11-29 06:12:33,322 INFO L750 eck$LassoCheckResult]: Loop: 1640#$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#2(~a.base, ~a.offset, 4); 1657#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 1642#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1651#$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#1(~b.base, ~b.offset, 4); 1650#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 1647#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1655#L25-1 assume true; 1652#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1653#L25-1 assume true; 1673#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1672#L25-1 assume true; 1671#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1670#L25-1 assume true; 1669#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1668#L25-1 assume true; 1667#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1666#L25-1 assume true; 1665#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1649#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1643#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1651#$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#1(~b.base, ~b.offset, 4); 1650#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 1647#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1655#L25-1 assume true; 1652#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1653#L25-1 assume true; 1673#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1672#L25-1 assume true; 1671#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1670#L25-1 assume true; 1669#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1668#L25-1 assume true; 1667#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1666#L25-1 assume true; 1665#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1649#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1643#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1651#$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#1(~b.base, ~b.offset, 4); 1650#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 1647#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#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; 1646#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1645#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 1648#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1655#L25-1 assume true; 1652#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1653#L25-1 assume true; 1673#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1672#L25-1 assume true; 1671#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1670#L25-1 assume true; 1669#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1668#L25-1 assume true; 1667#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1666#L25-1 assume true; 1665#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1649#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1643#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1651#$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#1(~b.base, ~b.offset, 4); 1650#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1641#L41-1 assume true; 1644#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1656#L41-1 assume true; 1664#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1663#L41-1 assume true; 1662#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1661#L41-1 assume true; 1660#func_to_recursive_line_22_to_23_0EXIT >#70#return; 1659#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 1638#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 1640#$Ultimate##0 [2023-11-29 06:12:33,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:33,324 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 6 times [2023-11-29 06:12:33,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:33,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061427832] [2023-11-29 06:12:33,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:33,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:33,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:12:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:33,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:12:33,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:33,345 INFO L85 PathProgramCache]: Analyzing trace with hash -11960144, now seen corresponding path program 4 times [2023-11-29 06:12:33,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:33,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357996345] [2023-11-29 06:12:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:33,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:34,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:35,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 06:12:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 06:12:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 06:12:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 14 proven. 307 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2023-11-29 06:12:36,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:12:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357996345] [2023-11-29 06:12:36,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357996345] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:12:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045220721] [2023-11-29 06:12:36,994 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:12:36,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:12:36,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:12:36,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:12:37,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:12:37,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:12:37,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:12:37,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-29 06:12:37,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:12:37,254 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 [2023-11-29 06:12:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 346 proven. 35 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2023-11-29 06:12:37,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:12:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 6 proven. 414 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2023-11-29 06:12:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045220721] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:12:40,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:12:40,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 26] total 45 [2023-11-29 06:12:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504640682] [2023-11-29 06:12:40,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:12:40,164 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:12:40,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:12:40,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 06:12:40,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 06:12:40,167 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) [2023-11-29 06:12:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:12:40,827 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-11-29 06:12:40,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2023-11-29 06:12:40,828 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:40,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 42 transitions. [2023-11-29 06:12:40,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2023-11-29 06:12:40,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-11-29 06:12:40,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 42 transitions. [2023-11-29 06:12:40,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:12:40,831 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-11-29 06:12:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 42 transitions. [2023-11-29 06:12:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-29 06:12:40,836 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) [2023-11-29 06:12:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-11-29 06:12:40,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-11-29 06:12:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:12:40,838 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-11-29 06:12:40,839 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 06:12:40,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2023-11-29 06:12:40,840 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:40,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:12:40,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:12:40,843 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 06:12:40,843 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] [2023-11-29 06:12:40,843 INFO L748 eck$LassoCheckResult]: Stem: 3025#$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); 3018#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#2(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#1(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3004#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);< 3005#$Ultimate##0 [2023-11-29 06:12:40,844 INFO L750 eck$LassoCheckResult]: Loop: 3005#$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#2(~a.base, ~a.offset, 4); 3024#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 3007#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3017#$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#1(~b.base, ~b.offset, 4); 3014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 3011#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3022#L25-1 assume true; 3019#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3020#L25-1 assume true; 3021#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3040#L25-1 assume true; 3039#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3038#L25-1 assume true; 3037#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3036#L25-1 assume true; 3035#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3034#L25-1 assume true; 3033#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3032#L25-1 assume true; 3031#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3016#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3008#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3017#$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#1(~b.base, ~b.offset, 4); 3014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 3011#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3022#L25-1 assume true; 3019#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3020#L25-1 assume true; 3021#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3040#L25-1 assume true; 3039#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3038#L25-1 assume true; 3037#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3036#L25-1 assume true; 3035#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3034#L25-1 assume true; 3033#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3032#L25-1 assume true; 3031#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3016#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3008#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3017#$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#1(~b.base, ~b.offset, 4); 3014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 3011#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#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; 3012#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3010#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 3013#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3022#L25-1 assume true; 3019#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3020#L25-1 assume true; 3021#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3040#L25-1 assume true; 3039#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3038#L25-1 assume true; 3037#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3036#L25-1 assume true; 3035#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3034#L25-1 assume true; 3033#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3032#L25-1 assume true; 3031#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3016#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3008#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3017#$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#1(~b.base, ~b.offset, 4); 3014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3015#L41-1 assume true; 3023#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3006#L41-1 assume true; 3009#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3030#L41-1 assume true; 3029#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3028#L41-1 assume true; 3027#func_to_recursive_line_22_to_23_0EXIT >#70#return; 3026#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 3003#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 3005#$Ultimate##0 [2023-11-29 06:12:40,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 7 times [2023-11-29 06:12:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913394334] [2023-11-29 06:12:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:40,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:40,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:12:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:40,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:12:40,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1552670328, now seen corresponding path program 5 times [2023-11-29 06:12:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:40,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475058493] [2023-11-29 06:12:40,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:40,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:41,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:42,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:42,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:42,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:42,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:12:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:12:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:12:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2023-11-29 06:12:43,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:12:43,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475058493] [2023-11-29 06:12:43,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475058493] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:12:43,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418070643] [2023-11-29 06:12:43,828 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 06:12:43,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:12:43,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:12:43,830 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:12:43,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 06:12:44,701 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-11-29 06:12:44,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:12:44,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 06:12:44,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:12:44,719 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 [2023-11-29 06:12:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2023-11-29 06:12:45,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:12:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2023-11-29 06:12:46,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418070643] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:12:46,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:12:46,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 18] total 34 [2023-11-29 06:12:46,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191018278] [2023-11-29 06:12:46,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:12:46,228 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:12:46,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:12:46,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 06:12:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=921, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 06:12:46,230 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. cyclomatic complexity: 7 Second operand has 34 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 15 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2023-11-29 06:12:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:12:46,760 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2023-11-29 06:12:46,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 46 transitions. [2023-11-29 06:12:46,761 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:46,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 46 transitions. [2023-11-29 06:12:46,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-29 06:12:46,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-29 06:12:46,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2023-11-29 06:12:46,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:12:46,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2023-11-29 06:12:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2023-11-29 06:12:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-29 06:12:46,767 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) [2023-11-29 06:12:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2023-11-29 06:12:46,768 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2023-11-29 06:12:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:12:46,769 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2023-11-29 06:12:46,769 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-29 06:12:46,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 46 transitions. [2023-11-29 06:12:46,770 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:12:46,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:12:46,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:12:46,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 06:12:46,773 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] [2023-11-29 06:12:46,773 INFO L748 eck$LassoCheckResult]: Stem: 4602#$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); 4598#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#2(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#1(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 4582#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);< 4583#$Ultimate##0 [2023-11-29 06:12:46,774 INFO L750 eck$LassoCheckResult]: Loop: 4583#$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#2(~a.base, ~a.offset, 4); 4601#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 4585#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4595#$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#1(~b.base, ~b.offset, 4); 4593#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 4590#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4599#L25-1 assume true; 4596#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4597#L25-1 assume true; 4622#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4621#L25-1 assume true; 4620#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4619#L25-1 assume true; 4618#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4617#L25-1 assume true; 4615#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4614#L25-1 assume true; 4612#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4610#L25-1 assume true; 4609#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4592#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4586#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4595#$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#1(~b.base, ~b.offset, 4); 4593#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 4590#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4599#L25-1 assume true; 4596#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4597#L25-1 assume true; 4622#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4621#L25-1 assume true; 4620#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4619#L25-1 assume true; 4618#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4617#L25-1 assume true; 4615#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4614#L25-1 assume true; 4612#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4610#L25-1 assume true; 4609#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4592#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4586#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4595#$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#1(~b.base, ~b.offset, 4); 4593#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 4590#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4599#L25-1 assume true; 4596#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4597#L25-1 assume true; 4622#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4621#L25-1 assume true; 4620#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4619#L25-1 assume true; 4618#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4617#L25-1 assume true; 4615#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4614#L25-1 assume true; 4612#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4610#L25-1 assume true; 4609#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4592#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4586#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4595#$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#1(~b.base, ~b.offset, 4); 4593#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 4590#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4599#L25-1 assume true; 4596#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4597#L25-1 assume true; 4622#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4621#L25-1 assume true; 4620#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4619#L25-1 assume true; 4618#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4617#L25-1 assume true; 4615#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4614#L25-1 assume true; 4612#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4610#L25-1 assume true; 4609#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4592#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4586#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4595#$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#1(~b.base, ~b.offset, 4); 4593#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 4590#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#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; 4589#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4588#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 4591#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4599#L25-1 assume true; 4596#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4597#L25-1 assume true; 4622#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4621#L25-1 assume true; 4620#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4619#L25-1 assume true; 4618#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4617#L25-1 assume true; 4615#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4614#L25-1 assume true; 4612#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4610#L25-1 assume true; 4609#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4592#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4586#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4595#$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#1(~b.base, ~b.offset, 4); 4593#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4594#L41-1 assume true; 4600#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4584#L41-1 assume true; 4587#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4616#L41-1 assume true; 4613#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4611#L41-1 assume true; 4608#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4607#L41-1 assume true; 4606#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4605#L41-1 assume true; 4604#func_to_recursive_line_22_to_23_0EXIT >#70#return; 4603#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 4581#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 4583#$Ultimate##0 [2023-11-29 06:12:46,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 8 times [2023-11-29 06:12:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777883548] [2023-11-29 06:12:46,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:46,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:12:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:12:46,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:12:46,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:46,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1937132614, now seen corresponding path program 6 times [2023-11-29 06:12:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:12:46,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681515741] [2023-11-29 06:12:46,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:46,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:12:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:50,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:50,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:50,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:50,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:50,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:50,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:50,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:50,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:12:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:51,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:51,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:51,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:51,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:51,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:12:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:12:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:12:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:12:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:12:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 2854 trivial. 0 not checked. [2023-11-29 06:12:52,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:12:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681515741] [2023-11-29 06:12:52,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681515741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:12:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928940867] [2023-11-29 06:12:52,829 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 06:12:52,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:12:52,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:12:52,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:12:52,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 06:12:58,722 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2023-11-29 06:12:58,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:12:58,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-29 06:12:58,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:12:58,747 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 [2023-11-29 06:12:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2023-11-29 06:12:59,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:13:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2023-11-29 06:13:01,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928940867] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:13:01,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:13:01,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 26] total 44 [2023-11-29 06:13:01,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778359418] [2023-11-29 06:13:01,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:13:01,621 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:13:01,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:13:01,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 06:13:01,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1557, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 06:13:01,623 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. cyclomatic complexity: 7 Second operand has 44 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 19 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) [2023-11-29 06:13:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:13:02,320 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2023-11-29 06:13:02,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2023-11-29 06:13:02,322 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:13:02,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 48 transitions. [2023-11-29 06:13:02,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2023-11-29 06:13:02,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2023-11-29 06:13:02,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 48 transitions. [2023-11-29 06:13:02,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:13:02,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2023-11-29 06:13:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 48 transitions. [2023-11-29 06:13:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-29 06:13:02,330 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) [2023-11-29 06:13:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2023-11-29 06:13:02,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2023-11-29 06:13:02,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:13:02,333 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2023-11-29 06:13:02,333 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-29 06:13:02,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2023-11-29 06:13:02,335 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 06:13:02,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:13:02,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:13:02,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 06:13:02,339 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] [2023-11-29 06:13:02,339 INFO L748 eck$LassoCheckResult]: Stem: 7334#$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); 7327#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#2(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#1(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 7313#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);< 7314#$Ultimate##0 [2023-11-29 06:13:02,340 INFO L750 eck$LassoCheckResult]: Loop: 7314#$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#2(~a.base, ~a.offset, 4); 7333#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 7316#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7326#$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#1(~b.base, ~b.offset, 4); 7323#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 7320#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7331#L25-1 assume true; 7328#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7329#L25-1 assume true; 7330#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7355#L25-1 assume true; 7354#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7353#L25-1 assume true; 7352#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7351#L25-1 assume true; 7349#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7348#L25-1 assume true; 7345#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7343#L25-1 assume true; 7342#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7325#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7317#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7326#$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#1(~b.base, ~b.offset, 4); 7323#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 7320#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7331#L25-1 assume true; 7328#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7329#L25-1 assume true; 7330#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7355#L25-1 assume true; 7354#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7353#L25-1 assume true; 7352#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7351#L25-1 assume true; 7349#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7348#L25-1 assume true; 7345#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7343#L25-1 assume true; 7342#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7325#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7317#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7326#$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#1(~b.base, ~b.offset, 4); 7323#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 7320#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7331#L25-1 assume true; 7328#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7329#L25-1 assume true; 7330#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7355#L25-1 assume true; 7354#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7353#L25-1 assume true; 7352#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7351#L25-1 assume true; 7349#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7348#L25-1 assume true; 7345#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7343#L25-1 assume true; 7342#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7325#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7317#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7326#$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#1(~b.base, ~b.offset, 4); 7323#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 7320#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7331#L25-1 assume true; 7328#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7329#L25-1 assume true; 7330#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7355#L25-1 assume true; 7354#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7353#L25-1 assume true; 7352#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7351#L25-1 assume true; 7349#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7348#L25-1 assume true; 7345#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7343#L25-1 assume true; 7342#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7325#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7317#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7326#$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#1(~b.base, ~b.offset, 4); 7323#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 7320#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7331#L25-1 assume true; 7328#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7329#L25-1 assume true; 7330#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7355#L25-1 assume true; 7354#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7353#L25-1 assume true; 7352#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7351#L25-1 assume true; 7349#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7348#L25-1 assume true; 7345#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7343#L25-1 assume true; 7342#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7325#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7317#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7326#$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#1(~b.base, ~b.offset, 4); 7323#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 7320#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#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; 7321#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7319#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 7322#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7331#L25-1 assume true; 7328#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7329#L25-1 assume true; 7330#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7355#L25-1 assume true; 7354#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7353#L25-1 assume true; 7352#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7351#L25-1 assume true; 7349#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7348#L25-1 assume true; 7345#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7343#L25-1 assume true; 7342#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7325#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7317#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7326#$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#1(~b.base, ~b.offset, 4); 7323#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7324#L41-1 assume true; 7332#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7315#L41-1 assume true; 7318#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7350#L41-1 assume true; 7347#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7346#L41-1 assume true; 7344#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7341#L41-1 assume true; 7340#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7339#L41-1 assume true; 7338#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7337#L41-1 assume true; 7336#func_to_recursive_line_22_to_23_0EXIT >#70#return; 7335#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 7312#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 7314#$Ultimate##0 [2023-11-29 06:13:02,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:02,341 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 9 times [2023-11-29 06:13:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:02,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143830651] [2023-11-29 06:13:02,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:02,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:02,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:02,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:02,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:02,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1363312666, now seen corresponding path program 7 times [2023-11-29 06:13:02,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:02,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238850832] [2023-11-29 06:13:02,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:02,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:02,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:02,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:02,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:02,624 INFO L85 PathProgramCache]: Analyzing trace with hash -993962585, now seen corresponding path program 1 times [2023-11-29 06:13:02,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:02,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680270862] [2023-11-29 06:13:02,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:02,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:02,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:17,432 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 06:13:17,432 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 06:13:17,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 06:13:17,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 06:13:17,433 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 06:13:17,433 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:17,433 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 06:13:17,433 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 06:13:17,433 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration9_Lasso [2023-11-29 06:13:17,433 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 06:13:17,433 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 06:13:17,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:17,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:18,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:18,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:18,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:18,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:18,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:18,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:18,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:18,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:18,971 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 06:13:18,976 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 06:13:18,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:18,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:18,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:18,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-29 06:13:18,982 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 [2023-11-29 06:13:18,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:18,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:18,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:18,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:18,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:18,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:18,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:19,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:19,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:19,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,008 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-29 06:13:19,012 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 [2023-11-29 06:13:19,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:19,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:19,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:19,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:19,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:19,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:19,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:19,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:19,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-11-29 06:13:19,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,036 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-29 06:13:19,040 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 [2023-11-29 06:13:19,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:19,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:19,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:19,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:19,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:19,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:19,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:19,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:19,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-11-29 06:13:19,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,062 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-29 06:13:19,068 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 [2023-11-29 06:13:19,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:19,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:19,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:19,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:19,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:19,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:19,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:19,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:19,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-11-29 06:13:19,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,090 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-29 06:13:19,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 [2023-11-29 06:13:19,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:19,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:19,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:19,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:19,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:19,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:19,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:19,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:19,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:19,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,113 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-29 06:13:19,117 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 [2023-11-29 06:13:19,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:19,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:19,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:19,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:19,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:19,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:19,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:19,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:19,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:19,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,140 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-29 06:13:19,145 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 [2023-11-29 06:13:19,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:19,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:19,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:19,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:19,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:19,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:19,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:19,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:19,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:19,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,166 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-29 06:13:19,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 [2023-11-29 06:13:19,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:19,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:19,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:19,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:19,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:19,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:19,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:19,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:19,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-11-29 06:13:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,190 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-29 06:13:19,194 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 [2023-11-29 06:13:19,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:19,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:19,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:19,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:19,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:19,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:19,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:19,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-11-29 06:13:19,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,222 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-29 06:13:19,227 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 [2023-11-29 06:13:19,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:19,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:19,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:19,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:19,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:19,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:19,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:19,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-11-29 06:13:19,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,252 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-29 06:13:19,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 [2023-11-29 06:13:19,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:19,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:19,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:19,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:19,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:19,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:19,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:19,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:19,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-11-29 06:13:19,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,275 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-29 06:13:19,278 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 [2023-11-29 06:13:19,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:19,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:19,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:19,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:19,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:19,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:19,306 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 06:13:19,324 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-11-29 06:13:19,325 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-11-29 06:13:19,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:19,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:19,331 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:19,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-29 06:13:19,337 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 06:13:19,353 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 06:13:19,353 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 06:13:19,354 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 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#2 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 [] [2023-11-29 06:13:19,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:19,444 INFO L156 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2023-11-29 06:13:19,454 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[#in~a!base][#in~a!offset] could not be translated [2023-11-29 06:13:19,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:19,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:13:19,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:20,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 2940 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 06:13:20,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:21,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-11-29 06:13:21,783 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 [2023-11-29 06:13:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4203 trivial. 0 not checked. [2023-11-29 06:13:21,817 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 [2023-11-29 06:13:21,818 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) [2023-11-29 06:13:22,051 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. [2023-11-29 06:13:22,052 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 [2023-11-29 06:13:22,053 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) [2023-11-29 06:13:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2023-11-29 06:13:22,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 255 letters. [2023-11-29 06:13:22,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:22,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 258 letters. Loop has 255 letters. [2023-11-29 06:13:22,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:22,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 510 letters. [2023-11-29 06:13:22,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:22,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions. [2023-11-29 06:13:22,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-11-29 06:13:22,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 87 states and 99 transitions. [2023-11-29 06:13:22,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-29 06:13:22,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2023-11-29 06:13:22,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 99 transitions. [2023-11-29 06:13:22,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 06:13:22,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 99 transitions. [2023-11-29 06:13:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 99 transitions. [2023-11-29 06:13:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2023-11-29 06:13:22,088 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) [2023-11-29 06:13:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-11-29 06:13:22,089 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-11-29 06:13:22,089 INFO L428 stractBuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-11-29 06:13:22,090 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-29 06:13:22,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions. [2023-11-29 06:13:22,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-11-29 06:13:22,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:13:22,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:13:22,092 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-29 06:13:22,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:13:22,092 INFO L748 eck$LassoCheckResult]: Stem: 8415#$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); 8402#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#2(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#1(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 8377#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);< 8379#$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#2(~a.base, ~a.offset, 4); 8414#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 8394#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 8400#$Ultimate##0 [2023-11-29 06:13:22,093 INFO L750 eck$LassoCheckResult]: Loop: 8400#$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#1(~b.base, ~b.offset, 4); 8393#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 8386#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8384#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8387#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; 8385#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8384#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8387#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; 8385#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8384#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8387#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; 8385#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8384#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8387#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; 8385#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8384#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8387#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; 8385#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8384#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8387#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; 8385#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8384#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8387#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8407#L25-1 assume true; 8403#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8404#L25-1 assume true; 8439#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8438#L25-1 assume true; 8437#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8436#L25-1 assume true; 8435#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8434#L25-1 assume true; 8433#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8432#L25-1 assume true; 8431#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8430#L25-1 assume true; 8429#func_to_recursive_line_23_to_23_0EXIT >#64#return; 8398#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 8395#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 8400#$Ultimate##0 [2023-11-29 06:13:22,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1482449922, now seen corresponding path program 1 times [2023-11-29 06:13:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:22,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488631005] [2023-11-29 06:13:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:22,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:22,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:22,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:22,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1388529776, now seen corresponding path program 1 times [2023-11-29 06:13:22,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:22,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849426669] [2023-11-29 06:13:22,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:22,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:22,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:22,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash -292174737, now seen corresponding path program 1 times [2023-11-29 06:13:22,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:22,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573049333] [2023-11-29 06:13:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:22,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:22,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:26,138 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 06:13:26,139 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 06:13:26,139 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 06:13:26,139 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 06:13:26,139 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 06:13:26,139 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:26,139 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 06:13:26,139 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 06:13:26,139 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration10_Lasso [2023-11-29 06:13:26,139 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 06:13:26,139 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 06:13:26,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:26,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:27,327 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 06:13:27,327 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 06:13:27,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,329 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-29 06:13:27,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 [2023-11-29 06:13:27,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:27,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:27,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:27,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:27,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:27,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:27,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:27,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:27,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-11-29 06:13:27,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,352 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-29 06:13:27,354 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 [2023-11-29 06:13:27,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:27,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:27,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:27,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:27,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:27,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:27,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:27,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:27,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-11-29 06:13:27,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,376 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-29 06:13:27,379 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 [2023-11-29 06:13:27,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:27,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:27,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:27,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:27,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:27,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:27,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:27,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:27,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-29 06:13:27,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,399 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-29 06:13:27,402 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 [2023-11-29 06:13:27,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:27,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:27,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:27,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:27,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:27,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:27,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:27,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:27,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-11-29 06:13:27,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,426 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-29 06:13:27,428 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 [2023-11-29 06:13:27,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:27,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:27,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:27,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:27,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:27,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:27,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:27,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:27,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-11-29 06:13:27,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,448 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-29 06:13:27,451 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 [2023-11-29 06:13:27,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:27,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:27,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:27,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:27,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:27,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:27,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:27,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:27,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-11-29 06:13:27,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,470 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-29 06:13:27,473 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 [2023-11-29 06:13:27,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:27,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:27,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:27,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:27,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:27,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:27,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:27,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:27,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-11-29 06:13:27,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,493 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-29 06:13:27,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:13:27,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:27,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:27,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:27,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:27,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:27,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:27,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:27,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:27,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-11-29 06:13:27,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,515 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-29 06:13:27,518 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 [2023-11-29 06:13:27,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:27,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:27,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:27,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:27,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:27,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:27,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:27,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:27,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:27,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,538 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-29 06:13:27,541 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 [2023-11-29 06:13:27,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:27,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:27,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:27,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:27,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:27,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:27,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:27,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:27,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:27,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,560 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-29 06:13:27,563 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 [2023-11-29 06:13:27,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:27,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:27,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:27,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:27,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:27,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:27,598 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 06:13:27,623 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-11-29 06:13:27,623 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-11-29 06:13:27,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:27,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:27,624 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:27,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-29 06:13:27,627 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 06:13:27,641 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2023-11-29 06:13:27,641 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 06:13:27,641 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int#1) 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#1) func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1 + 13 Supporting invariants [-1*v_rep(select (select old(#memory_int#1) 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#1 func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1 >= 0, -1*v_rep(select (select old(#memory_int#1) func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 + 6 >= 0] [2023-11-29 06:13:27,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-11-29 06:13:27,709 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2023-11-29 06:13:27,712 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#1)[#in~b!base][#in~b!offset] could not be translated [2023-11-29 06:13:27,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:27,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:13:27,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:27,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 06:13:27,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:27,874 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 [2023-11-29 06:13:28,137 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 [2023-11-29 06:13:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-29 06:13:28,164 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 [2023-11-29 06:13:28,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 4 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) [2023-11-29 06:13:28,390 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 4 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 23 states. [2023-11-29 06:13:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2023-11-29 06:13:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 4 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) [2023-11-29 06:13:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2023-11-29 06:13:28,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 6 letters. Loop has 39 letters. [2023-11-29 06:13:28,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:28,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 45 letters. Loop has 39 letters. [2023-11-29 06:13:28,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:28,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 6 letters. Loop has 78 letters. [2023-11-29 06:13:28,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:28,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 287 transitions. [2023-11-29 06:13:28,400 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-29 06:13:28,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 155 states and 182 transitions. [2023-11-29 06:13:28,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-11-29 06:13:28,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-11-29 06:13:28,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 182 transitions. [2023-11-29 06:13:28,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 06:13:28,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155 states and 182 transitions. [2023-11-29 06:13:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 182 transitions. [2023-11-29 06:13:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2023-11-29 06:13:28,422 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) [2023-11-29 06:13:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2023-11-29 06:13:28,424 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 166 transitions. [2023-11-29 06:13:28,424 INFO L428 stractBuchiCegarLoop]: Abstraction has 142 states and 166 transitions. [2023-11-29 06:13:28,424 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-29 06:13:28,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 166 transitions. [2023-11-29 06:13:28,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-29 06:13:28,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:13:28,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:13:28,426 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:13:28,426 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 06:13:28,427 INFO L748 eck$LassoCheckResult]: Stem: 8999#$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); 8983#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#2(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#1(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 8949#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);< 8951#$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#2(~a.base, ~a.offset, 4); 8996#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 8970#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 8986#$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#1(~b.base, ~b.offset, 4); 8968#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 8953#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8952#$Ultimate##0 [2023-11-29 06:13:28,427 INFO L750 eck$LassoCheckResult]: Loop: 8952#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8954#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; 8955#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8952#$Ultimate##0 [2023-11-29 06:13:28,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:28,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1483069382, now seen corresponding path program 1 times [2023-11-29 06:13:28,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:28,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822612386] [2023-11-29 06:13:28,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:28,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:28,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:28,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:28,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 1 times [2023-11-29 06:13:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:28,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779638732] [2023-11-29 06:13:28,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:28,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:28,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:28,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:28,470 INFO L85 PathProgramCache]: Analyzing trace with hash 208614944, now seen corresponding path program 1 times [2023-11-29 06:13:28,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:28,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669704556] [2023-11-29 06:13:28,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:28,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:28,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:31,277 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 06:13:31,277 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 06:13:31,277 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 06:13:31,277 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 06:13:31,277 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 06:13:31,277 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:31,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 06:13:31,278 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 06:13:31,278 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration11_Lasso [2023-11-29 06:13:31,278 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 06:13:31,278 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 06:13:31,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-11-29 06:13:31,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:31,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:32,060 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 06:13:32,060 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 06:13:32,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,061 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-29 06:13:32,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:13:32,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:32,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:32,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:32,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:32,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,083 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-29 06:13:32,086 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 [2023-11-29 06:13:32,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:32,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:32,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:32,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:32,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,105 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-11-29 06:13:32,107 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 [2023-11-29 06:13:32,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:32,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:32,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:32,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2023-11-29 06:13:32,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,126 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-11-29 06:13:32,129 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 [2023-11-29 06:13:32,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:32,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:32,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:32,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-11-29 06:13:32,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,148 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-11-29 06:13:32,151 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 [2023-11-29 06:13:32,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:32,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:32,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:32,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-11-29 06:13:32,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,170 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-11-29 06:13:32,173 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 [2023-11-29 06:13:32,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:32,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:32,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:32,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-11-29 06:13:32,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,192 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-11-29 06:13:32,195 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 [2023-11-29 06:13:32,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:32,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:32,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:32,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,213 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-11-29 06:13:32,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,214 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-11-29 06:13:32,217 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 [2023-11-29 06:13:32,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:32,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:32,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-11-29 06:13:32,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,239 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-11-29 06:13:32,241 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 [2023-11-29 06:13:32,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:32,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:32,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2023-11-29 06:13:32,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,266 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-11-29 06:13:32,269 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 [2023-11-29 06:13:32,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:32,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:32,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-11-29 06:13:32,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,292 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-29 06:13:32,296 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 [2023-11-29 06:13:32,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:32,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:32,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:32,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,320 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-29 06:13:32,323 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 [2023-11-29 06:13:32,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:32,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:32,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-11-29 06:13:32,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,346 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-29 06:13:32,348 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 [2023-11-29 06:13:32,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:32,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:32,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-11-29 06:13:32,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,372 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-29 06:13:32,375 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 [2023-11-29 06:13:32,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:32,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:32,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-11-29 06:13:32,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,400 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-11-29 06:13:32,403 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 [2023-11-29 06:13:32,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:32,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:32,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:32,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:32,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,428 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-11-29 06:13:32,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 [2023-11-29 06:13:32,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:32,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:32,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:32,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:32,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:32,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:32,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 06:13:32,488 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-29 06:13:32,488 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-11-29 06:13:32,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:32,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:32,489 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:32,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-11-29 06:13:32,492 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 06:13:32,505 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 06:13:32,506 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 06:13:32,506 INFO L515 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 [] [2023-11-29 06:13:32,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-11-29 06:13:32,533 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2023-11-29 06:13:32,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[#in~c!base][0] could not be translated [2023-11-29 06:13:32,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:32,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 06:13:32,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:32,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 06:13:32,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:32,752 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 [2023-11-29 06:13:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:13:32,782 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2023-11-29 06:13:32,782 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34 Second operand has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2023-11-29 06:13:32,945 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34. Second operand has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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 19 states. [2023-11-29 06:13:32,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-29 06:13:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2023-11-29 06:13:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2023-11-29 06:13:32,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2023-11-29 06:13:32,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:32,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2023-11-29 06:13:32,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:32,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2023-11-29 06:13:32,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:32,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 223 transitions. [2023-11-29 06:13:32,951 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-29 06:13:32,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 162 states and 200 transitions. [2023-11-29 06:13:32,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2023-11-29 06:13:32,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2023-11-29 06:13:32,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 200 transitions. [2023-11-29 06:13:32,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 06:13:32,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2023-11-29 06:13:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 200 transitions. [2023-11-29 06:13:32,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-11-29 06:13:32,971 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) [2023-11-29 06:13:32,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2023-11-29 06:13:32,973 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2023-11-29 06:13:32,973 INFO L428 stractBuchiCegarLoop]: Abstraction has 162 states and 200 transitions. [2023-11-29 06:13:32,973 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-29 06:13:32,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 200 transitions. [2023-11-29 06:13:32,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-29 06:13:32,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:13:32,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:13:32,975 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:13:32,975 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 06:13:32,975 INFO L748 eck$LassoCheckResult]: Stem: 9445#$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); 9424#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#2(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#1(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 9391#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);< 9393#$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#2(~a.base, ~a.offset, 4); 9442#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 9431#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9430#$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#1(~b.base, ~b.offset, 4); 9432#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 9461#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9463#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9503#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; 9470#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9474#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9544#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; 9471#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9474#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9544#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; 9471#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9474#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9544#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; 9471#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9474#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9544#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; 9471#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9474#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9544#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; 9471#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9474#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9501#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9502#L25-1 assume true; 9492#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9490#L25-1 assume true; 9488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9487#L25-1 assume true; 9483#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9480#L25-1 assume true; 9479#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9478#L25-1 assume true; 9477#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9473#L25-1 assume true; 9468#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9467#L25-1 assume true; 9460#func_to_recursive_line_23_to_23_0EXIT >#64#return; 9458#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 9412#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9455#$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#1(~b.base, ~b.offset, 4); 9411#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 9395#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9394#$Ultimate##0 [2023-11-29 06:13:32,976 INFO L750 eck$LassoCheckResult]: Loop: 9394#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9397#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; 9396#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9394#$Ultimate##0 [2023-11-29 06:13:32,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1721128109, now seen corresponding path program 2 times [2023-11-29 06:13:32,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:32,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017771461] [2023-11-29 06:13:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:33,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:33,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:33,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 2 times [2023-11-29 06:13:33,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:33,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171069192] [2023-11-29 06:13:33,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:33,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:33,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:33,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash 807915725, now seen corresponding path program 3 times [2023-11-29 06:13:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:33,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667385758] [2023-11-29 06:13:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:33,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:33,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:33,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:37,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-11-29 06:13:38,066 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 06:13:38,066 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 06:13:38,066 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 06:13:38,066 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 06:13:38,066 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 06:13:38,067 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:38,067 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 06:13:38,067 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 06:13:38,067 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration12_Lasso [2023-11-29 06:13:38,067 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 06:13:38,067 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 06:13:38,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:13:38,848 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 06:13:38,849 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 06:13:38,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:38,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:38,850 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:38,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-11-29 06:13:38,853 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 [2023-11-29 06:13:38,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:38,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:38,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:38,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:38,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:38,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:38,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:38,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:38,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:38,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:38,871 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:38,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-11-29 06:13:38,874 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 [2023-11-29 06:13:38,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:38,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:38,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:38,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:38,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:38,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:38,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:38,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:38,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2023-11-29 06:13:38,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:38,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:38,893 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:38,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-11-29 06:13:38,896 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 [2023-11-29 06:13:38,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:38,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:38,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:38,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:38,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:38,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:38,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:38,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:38,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:38,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:38,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:38,915 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:38,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-11-29 06:13:38,918 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 [2023-11-29 06:13:38,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:38,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:38,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:38,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:38,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:38,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:38,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:38,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:38,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2023-11-29 06:13:38,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:38,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:38,936 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:38,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-11-29 06:13:38,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:13:38,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:38,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:38,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:38,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:38,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:38,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:38,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:38,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:38,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:38,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:38,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:38,958 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:38,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-11-29 06:13:38,961 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 [2023-11-29 06:13:38,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:38,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:38,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:38,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:38,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:38,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:38,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:38,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:38,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:38,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:38,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:38,979 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:38,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-11-29 06:13:38,982 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 [2023-11-29 06:13:38,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:38,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:38,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:38,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:38,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:38,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:38,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:38,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:38,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:38,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:38,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,000 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-11-29 06:13:39,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 [2023-11-29 06:13:39,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2023-11-29 06:13:39,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,023 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-11-29 06:13:39,026 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 [2023-11-29 06:13:39,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2023-11-29 06:13:39,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,045 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-11-29 06:13:39,048 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 [2023-11-29 06:13:39,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:39,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:39,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2023-11-29 06:13:39,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,072 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-11-29 06:13:39,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 [2023-11-29 06:13:39,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:39,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:39,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2023-11-29 06:13:39,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,101 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-11-29 06:13:39,103 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 [2023-11-29 06:13:39,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2023-11-29 06:13:39,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,123 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-11-29 06:13:39,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:13:39,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:39,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,145 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-11-29 06:13:39,147 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 [2023-11-29 06:13:39,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:39,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,166 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-11-29 06:13:39,169 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 [2023-11-29 06:13:39,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2023-11-29 06:13:39,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,188 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-11-29 06:13:39,191 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 [2023-11-29 06:13:39,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2023-11-29 06:13:39,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,210 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-11-29 06:13:39,212 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 [2023-11-29 06:13:39,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:39,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,232 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-11-29 06:13:39,234 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 [2023-11-29 06:13:39,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:39,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,254 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-11-29 06:13:39,257 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 [2023-11-29 06:13:39,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2023-11-29 06:13:39,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,276 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-11-29 06:13:39,279 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 [2023-11-29 06:13:39,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:39,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,298 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-11-29 06:13:39,300 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 [2023-11-29 06:13:39,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2023-11-29 06:13:39,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,319 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-11-29 06:13:39,322 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 [2023-11-29 06:13:39,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2023-11-29 06:13:39,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,341 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-11-29 06:13:39,344 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 [2023-11-29 06:13:39,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2023-11-29 06:13:39,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,363 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-11-29 06:13:39,366 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 [2023-11-29 06:13:39,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:39,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,385 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2023-11-29 06:13:39,388 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 [2023-11-29 06:13:39,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2023-11-29 06:13:39,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,407 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2023-11-29 06:13:39,409 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 [2023-11-29 06:13:39,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2023-11-29 06:13:39,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,428 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2023-11-29 06:13:39,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 [2023-11-29 06:13:39,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2023-11-29 06:13:39,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,450 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2023-11-29 06:13:39,452 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 [2023-11-29 06:13:39,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:13:39,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:13:39,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:13:39,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:39,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,471 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2023-11-29 06:13:39,474 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 [2023-11-29 06:13:39,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:39,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:39,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2023-11-29 06:13:39,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,498 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2023-11-29 06:13:39,501 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 [2023-11-29 06:13:39,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:39,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:39,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:13:39,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:39,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,527 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2023-11-29 06:13:39,530 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 [2023-11-29 06:13:39,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:13:39,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:13:39,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:13:39,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:13:39,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:13:39,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:13:39,568 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 06:13:39,587 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-11-29 06:13:39,587 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-11-29 06:13:39,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:13:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:39,588 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:39,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2023-11-29 06:13:39,590 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 06:13:39,604 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 06:13:39,604 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 06:13:39,604 INFO L515 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)_2) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_2 + 11 Supporting invariants [] [2023-11-29 06:13:39,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2023-11-29 06:13:39,627 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2023-11-29 06:13:39,629 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[#in~c!base][0] could not be translated [2023-11-29 06:13:39,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:39,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 06:13:39,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:40,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 06:13:40,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:40,315 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 [2023-11-29 06:13:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:13:40,348 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 [2023-11-29 06:13:40,348 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:40,684 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 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 19 states. [2023-11-29 06:13:40,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-29 06:13:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2023-11-29 06:13:40,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2023-11-29 06:13:40,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:40,690 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 06:13:40,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:40,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 06:13:40,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:41,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 06:13:41,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:41,416 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 [2023-11-29 06:13:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:13:41,450 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 3 loop predicates [2023-11-29 06:13:41,450 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:41,782 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 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 19 states. [2023-11-29 06:13:41,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-29 06:13:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2023-11-29 06:13:41,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2023-11-29 06:13:41,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:41,785 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 06:13:41,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:41,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 06:13:41,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:42,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2023-11-29 06:13:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:42,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 06:13:42,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:42,510 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 [2023-11-29 06:13:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:13:42,544 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2023-11-29 06:13:42,544 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:42,971 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 254 states and 295 transitions. Complement of second has 26 states. [2023-11-29 06:13:42,973 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 [2023-11-29 06:13:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2023-11-29 06:13:42,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 30 transitions. Stem has 48 letters. Loop has 3 letters. [2023-11-29 06:13:42,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:42,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 30 transitions. Stem has 51 letters. Loop has 3 letters. [2023-11-29 06:13:42,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:42,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 30 transitions. Stem has 48 letters. Loop has 6 letters. [2023-11-29 06:13:42,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:13:42,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 295 transitions. [2023-11-29 06:13:42,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 06:13:42,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 138 states and 167 transitions. [2023-11-29 06:13:42,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-29 06:13:42,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-11-29 06:13:42,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 167 transitions. [2023-11-29 06:13:42,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 06:13:42,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 167 transitions. [2023-11-29 06:13:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 167 transitions. [2023-11-29 06:13:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2023-11-29 06:13:42,994 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, (42), 30 states have call predecessors, (42), 17 states have call successors, (42) [2023-11-29 06:13:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2023-11-29 06:13:42,995 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 137 transitions. [2023-11-29 06:13:42,995 INFO L428 stractBuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2023-11-29 06:13:42,995 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-29 06:13:42,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 137 transitions. [2023-11-29 06:13:42,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 06:13:42,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:13:42,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:13:42,999 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] [2023-11-29 06:13:43,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:13:43,000 INFO L748 eck$LassoCheckResult]: Stem: 10837#$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); 10825#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#2(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#1(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 10792#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);< 10794#$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#2(~a.base, ~a.offset, 4); 10833#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 10814#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10883#$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#1(~b.base, ~b.offset, 4); 10868#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10805#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10802#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10804#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; 10829#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10907#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10908#L25-1 assume true; 10898#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10897#L25-1 assume true; 10896#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10894#L25-1 assume true; 10892#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10891#L25-1 assume true; 10890#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10889#L25-1 assume true; 10888#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10876#L25-1 assume true; 10874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10872#L25-1 assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10813#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10811#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10816#$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#1(~b.base, ~b.offset, 4); 10809#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10803#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10802#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10804#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; 10829#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10907#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10908#L25-1 assume true; 10898#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10897#L25-1 assume true; 10896#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10894#L25-1 assume true; 10892#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10891#L25-1 assume true; 10890#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10889#L25-1 assume true; 10888#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10876#L25-1 assume true; 10874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10872#L25-1 assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10867#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10810#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10816#$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#1(~b.base, ~b.offset, 4); 10809#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10803#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10802#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10804#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; 10829#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10907#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10908#L25-1 assume true; 10898#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10897#L25-1 assume true; 10896#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10894#L25-1 assume true; 10892#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10891#L25-1 assume true; 10890#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10889#L25-1 assume true; 10888#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10876#L25-1 assume true; 10874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10872#L25-1 assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10867#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10810#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10816#$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#1(~b.base, ~b.offset, 4); 10809#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10803#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10802#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10804#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; 10829#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10907#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10908#L25-1 assume true; 10898#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10897#L25-1 assume true; 10896#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10894#L25-1 assume true; 10892#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10891#L25-1 assume true; 10890#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10889#L25-1 assume true; 10888#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10876#L25-1 assume true; 10874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10872#L25-1 assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10867#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10810#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10816#$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#1(~b.base, ~b.offset, 4); 10809#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10803#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10802#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10804#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; 10829#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10907#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10908#L25-1 assume true; 10898#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10897#L25-1 assume true; 10896#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10894#L25-1 assume true; 10892#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10891#L25-1 assume true; 10890#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10889#L25-1 assume true; 10888#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10876#L25-1 assume true; 10874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10872#L25-1 assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10867#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10810#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10816#$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#1(~b.base, ~b.offset, 4); 10809#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10803#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10802#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10804#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; 10829#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10906#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; 10875#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10877#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10907#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10908#L25-1 assume true; 10898#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10897#L25-1 assume true; 10896#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10894#L25-1 assume true; 10892#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10891#L25-1 assume true; 10890#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10889#L25-1 assume true; 10888#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10876#L25-1 assume true; 10874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10872#L25-1 assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10867#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10810#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10816#$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#1(~b.base, ~b.offset, 4); 10869#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10870#L41-1 assume true; 10878#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10832#L41-1 assume true; 10853#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10852#L41-1 assume true; 10851#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10850#L41-1 assume true; 10849#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10848#L41-1 assume true; 10847#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10846#L41-1 assume true; 10845#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10844#L41-1 assume true; 10843#func_to_recursive_line_22_to_23_0EXIT >#70#return; 10840#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 10791#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 10793#$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#2(~a.base, ~a.offset, 4); 10835#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 10807#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10815#$Ultimate##0 [2023-11-29 06:13:43,001 INFO L750 eck$LassoCheckResult]: Loop: 10815#$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#1(~b.base, ~b.offset, 4); 10806#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10800#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10799#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10801#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; 10819#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10841#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10842#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; 10818#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10841#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10842#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; 10818#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10841#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10842#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; 10818#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10841#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10842#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; 10818#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10841#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10842#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; 10818#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10841#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10828#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10826#L25-1 assume true; 10817#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10820#L25-1 assume true; 10864#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10863#L25-1 assume true; 10862#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10861#L25-1 assume true; 10860#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10859#L25-1 assume true; 10858#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10857#L25-1 assume true; 10856#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10855#L25-1 assume true; 10854#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10812#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10808#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10815#$Ultimate##0 [2023-11-29 06:13:43,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1634781349, now seen corresponding path program 2 times [2023-11-29 06:13:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:43,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392557237] [2023-11-29 06:13:43,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:43,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:43,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:43,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:43,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1388529776, now seen corresponding path program 2 times [2023-11-29 06:13:43,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:43,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814271751] [2023-11-29 06:13:43,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:43,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:43,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:43,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:13:43,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash -350990602, now seen corresponding path program 3 times [2023-11-29 06:13:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:43,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220011761] [2023-11-29 06:13:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:43,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:43,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:13:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:13:43,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:14:02,592 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 06:14:02,592 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 06:14:02,592 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 06:14:02,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 06:14:02,593 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 06:14:02,593 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:02,593 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 06:14:02,593 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 06:14:02,593 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration13_Lasso [2023-11-29 06:14:02,593 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 06:14:02,593 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 06:14:02,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:02,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:02,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:02,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:02,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:02,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:02,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:02,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:14:03,740 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 06:14:03,740 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 06:14:03,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:03,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:03,742 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:03,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2023-11-29 06:14:03,744 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 [2023-11-29 06:14:03,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:03,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:14:03,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:03,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:03,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:03,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:14:03,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:14:03,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:03,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2023-11-29 06:14:03,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:03,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:03,763 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:03,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2023-11-29 06:14:03,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 [2023-11-29 06:14:03,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:03,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:14:03,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:03,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:03,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:03,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:14:03,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:14:03,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:03,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2023-11-29 06:14:03,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:03,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:03,785 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:03,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2023-11-29 06:14:03,788 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 [2023-11-29 06:14:03,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:03,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:14:03,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:03,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:03,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:03,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:14:03,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:14:03,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:03,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2023-11-29 06:14:03,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:03,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:03,807 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:03,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2023-11-29 06:14:03,810 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 [2023-11-29 06:14:03,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:03,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:03,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:03,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:03,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:03,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:03,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:03,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2023-11-29 06:14:03,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:03,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:03,832 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:03,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2023-11-29 06:14:03,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 [2023-11-29 06:14:03,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:03,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:03,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:03,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:03,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:03,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:03,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:03,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2023-11-29 06:14:03,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:03,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:03,857 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:03,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2023-11-29 06:14:03,860 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 [2023-11-29 06:14:03,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:03,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:14:03,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:03,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:03,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:03,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:14:03,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:14:03,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:03,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2023-11-29 06:14:03,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:03,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:03,879 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:03,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2023-11-29 06:14:03,882 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 [2023-11-29 06:14:03,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:03,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:14:03,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:03,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:03,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:03,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:14:03,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:14:03,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:03,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2023-11-29 06:14:03,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:03,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:03,901 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:03,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2023-11-29 06:14:03,904 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 [2023-11-29 06:14:03,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:03,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:14:03,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:03,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:03,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:03,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:14:03,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:14:03,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:03,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2023-11-29 06:14:03,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:03,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:03,923 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:03,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2023-11-29 06:14:03,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 [2023-11-29 06:14:03,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:03,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:03,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:03,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:03,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:03,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:03,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:03,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2023-11-29 06:14:03,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:03,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:03,948 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:03,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2023-11-29 06:14:03,951 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 [2023-11-29 06:14:03,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:03,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:03,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:03,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:03,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:03,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:03,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:03,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2023-11-29 06:14:03,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:03,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:03,974 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:03,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2023-11-29 06:14:03,977 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 [2023-11-29 06:14:03,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:03,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:03,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:03,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:03,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:03,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:04,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:04,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2023-11-29 06:14:04,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:04,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:04,005 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:04,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2023-11-29 06:14:04,008 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 [2023-11-29 06:14:04,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:04,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:04,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:04,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:04,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:04,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:04,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:04,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2023-11-29 06:14:04,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:04,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:04,032 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:04,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2023-11-29 06:14:04,035 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 [2023-11-29 06:14:04,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:04,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:04,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:04,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:04,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:04,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:04,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:04,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2023-11-29 06:14:04,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:04,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:04,057 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:04,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2023-11-29 06:14:04,059 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 [2023-11-29 06:14:04,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:04,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:04,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:04,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:04,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:04,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:04,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:04,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2023-11-29 06:14:04,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:04,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:04,082 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:04,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2023-11-29 06:14:04,085 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 [2023-11-29 06:14:04,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:04,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:04,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:04,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:04,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:04,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:04,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:04,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2023-11-29 06:14:04,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:04,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:04,107 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:04,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2023-11-29 06:14:04,110 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 [2023-11-29 06:14:04,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:04,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:04,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:04,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:04,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:04,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:04,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:04,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2023-11-29 06:14:04,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:04,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:04,138 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:04,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2023-11-29 06:14:04,141 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 [2023-11-29 06:14:04,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:04,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:04,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:04,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:04,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:04,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:04,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:04,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2023-11-29 06:14:04,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:04,166 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:04,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2023-11-29 06:14:04,169 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 [2023-11-29 06:14:04,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:04,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:04,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:04,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:04,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:04,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:04,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:14:04,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2023-11-29 06:14:04,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:04,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:04,191 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:04,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2023-11-29 06:14:04,194 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 [2023-11-29 06:14:04,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:14:04,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:14:04,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:14:04,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:14:04,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:14:04,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:14:04,227 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 06:14:04,252 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-11-29 06:14:04,252 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-11-29 06:14:04,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:14:04,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:14:04,253 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:14:04,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2023-11-29 06:14:04,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 06:14:04,270 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 06:14:04,270 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 06:14:04,270 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 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#1 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 [] [2023-11-29 06:14:04,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2023-11-29 06:14:04,320 INFO L156 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2023-11-29 06:14:04,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#in~b!base][#in~b!offset] could not be translated [2023-11-29 06:14:04,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:14:04,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2023-11-29 06:14:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:14:04,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-29 06:14:04,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:14:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:14:07,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 06:14:07,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:14:07,720 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 [2023-11-29 06:14:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-29 06:14:07,741 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 [2023-11-29 06:14:07,741 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26 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) [2023-11-29 06:14:07,903 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26. 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 172 transitions. Complement of second has 23 states. [2023-11-29 06:14:07,904 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 [2023-11-29 06:14:07,905 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) [2023-11-29 06:14:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2023-11-29 06:14:07,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2023-11-29 06:14:07,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:14:07,906 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 06:14:07,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:14:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:14:08,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-29 06:14:08,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:14:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:14:11,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 06:14:11,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:14:11,302 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 [2023-11-29 06:14:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-29 06:14:11,326 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 [2023-11-29 06:14:11,326 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26 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) [2023-11-29 06:14:11,499 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26. 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 172 transitions. Complement of second has 23 states. [2023-11-29 06:14:11,499 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 [2023-11-29 06:14:11,500 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) [2023-11-29 06:14:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2023-11-29 06:14:11,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2023-11-29 06:14:11,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:14:11,501 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 06:14:11,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:14:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:14:12,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-29 06:14:12,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:14:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:14:14,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 06:14:14,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:14:14,712 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 [2023-11-29 06:14:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-29 06:14:14,736 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 [2023-11-29 06:14:14,737 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26 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) [2023-11-29 06:14:14,936 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26. 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 217 states and 246 transitions. Complement of second has 23 states. [2023-11-29 06:14:14,937 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 [2023-11-29 06:14:14,937 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) [2023-11-29 06:14:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2023-11-29 06:14:14,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 261 letters. Loop has 39 letters. [2023-11-29 06:14:14,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:14:14,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 300 letters. Loop has 39 letters. [2023-11-29 06:14:14,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:14:14,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 261 letters. Loop has 78 letters. [2023-11-29 06:14:14,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:14:14,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 246 transitions. [2023-11-29 06:14:14,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 06:14:14,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 0 states and 0 transitions. [2023-11-29 06:14:14,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-11-29 06:14:14,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-11-29 06:14:14,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-11-29 06:14:14,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:14:14,944 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:14:14,944 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:14:14,944 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:14:14,944 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-29 06:14:14,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-11-29 06:14:14,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 06:14:14,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-11-29 06:14:14,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 06:14:14 BoogieIcfgContainer [2023-11-29 06:14:14,951 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-29 06:14:14,951 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:14:14,952 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:14:14,952 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:14:14,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:12:21" (3/4) ... [2023-11-29 06:14:14,953 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:14:14,954 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:14:14,955 INFO L158 Benchmark]: Toolchain (without parser) took 113893.30ms. Allocated memory was 146.8MB in the beginning and 836.8MB in the end (delta: 690.0MB). Free memory was 109.7MB in the beginning and 346.0MB in the end (delta: -236.4MB). Peak memory consumption was 454.0MB. Max. memory is 16.1GB. [2023-11-29 06:14:14,955 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 98.6MB. Free memory was 45.1MB in the beginning and 45.0MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:14:14,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.14ms. Allocated memory is still 146.8MB. Free memory was 109.7MB in the beginning and 99.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 06:14:14,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.32ms. Allocated memory is still 146.8MB. Free memory was 99.2MB in the beginning and 97.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:14:14,956 INFO L158 Benchmark]: Boogie Preprocessor took 57.17ms. Allocated memory is still 146.8MB. Free memory was 97.9MB in the beginning and 95.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:14:14,956 INFO L158 Benchmark]: RCFGBuilder took 438.89ms. Allocated memory is still 146.8MB. Free memory was 95.4MB in the beginning and 81.1MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 06:14:14,957 INFO L158 Benchmark]: BuchiAutomizer took 113120.53ms. Allocated memory was 146.8MB in the beginning and 836.8MB in the end (delta: 690.0MB). Free memory was 81.1MB in the beginning and 346.0MB in the end (delta: -264.9MB). Peak memory consumption was 426.8MB. Max. memory is 16.1GB. [2023-11-29 06:14:14,957 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 836.8MB. Free memory is still 346.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:14:14,958 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.22ms. Allocated memory is still 98.6MB. Free memory was 45.1MB in the beginning and 45.0MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.14ms. Allocated memory is still 146.8MB. Free memory was 109.7MB in the beginning and 99.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.32ms. Allocated memory is still 146.8MB. Free memory was 99.2MB in the beginning and 97.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.17ms. Allocated memory is still 146.8MB. Free memory was 97.9MB in the beginning and 95.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.89ms. Allocated memory is still 146.8MB. Free memory was 95.4MB in the beginning and 81.1MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 113120.53ms. Allocated memory was 146.8MB in the beginning and 836.8MB in the end (delta: 690.0MB). Free memory was 81.1MB in the beginning and 346.0MB in the end (delta: -264.9MB). Peak memory consumption was 426.8MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 836.8MB. Free memory is still 346.0MB. 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: ArrayAccessExpression #memory_int#2[#in~a!base][#in~a!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#1)[#in~b!base][#in~b!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[#in~c!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[#in~c!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#in~b!base][#in~b!offset] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (8 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 7 locations. One deterministic module has affine ranking function null and consists of 10 locations. One nondeterministic module has affine ranking function null and consists of 11 locations. One nondeterministic module has affine ranking function null and consists of 8 locations. 8 modules have a trivial ranking function, the largest among these consists of 45 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 113.0s and 14 iterations. TraceHistogramMax:42. Analysis of lassos took 91.0s. Construction of modules took 2.4s. Büchi inclusion checks took 19.3s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 48 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, 568 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 556 mSDsluCounter, 1322 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1058 mSDsCounter, 505 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2414 IncrementalHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 505 mSolverCounterUnsat, 264 mSDtfsCounter, 2414 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI8 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: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-11-29 06:14:14,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 06:14:15,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 06:14:15,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 06:14:15,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 06:14:15,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:14:15,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 06:14:16,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b8be4-712c-4649-8846-031eea4bf247/bin/uautomizer-verify-BQ2R08f2Ya/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