./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.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_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/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_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/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_761e9011-fb77-4052-8d78-585865907a21/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 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:53:49,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:53:49,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-29 03:53:49,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:53:49,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:53:49,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:53:49,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:53:49,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:53:49,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:53:49,471 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:53:49,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:53:49,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:53:49,473 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:53:49,474 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 03:53:49,474 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 03:53:49,475 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 03:53:49,475 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 03:53:49,476 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 03:53:49,476 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 03:53:49,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:53:49,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 03:53:49,478 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:53:49,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:53:49,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:53:49,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:53:49,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 03:53:49,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 03:53:49,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 03:53:49,481 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:53:49,482 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:53:49,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:53:49,482 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 03:53:49,483 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:53:49,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:53:49,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:53:49,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:53:49,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:53:49,484 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 03:53:49,485 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_761e9011-fb77-4052-8d78-585865907a21/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_761e9011-fb77-4052-8d78-585865907a21/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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2023-11-29 03:53:49,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:53:49,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:53:49,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:53:49,721 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:53:49,722 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:53:49,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2023-11-29 03:53:52,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:53:52,668 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:53:52,668 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2023-11-29 03:53:52,677 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/data/c8c938286/ddab4e61afbe495eafd3da5aa756bc8b/FLAGaf3a3ccf9 [2023-11-29 03:53:52,692 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/data/c8c938286/ddab4e61afbe495eafd3da5aa756bc8b [2023-11-29 03:53:52,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:53:52,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:53:52,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:53:52,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:53:52,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:53:52,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:52,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff28a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52, skipping insertion in model container [2023-11-29 03:53:52,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:52,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:53:52,886 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:53:52,898 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:53:52,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:53:52,934 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:53:52,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52 WrapperNode [2023-11-29 03:53:52,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:53:52,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:53:52,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:53:52,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:53:52,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:52,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:52,970 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2023-11-29 03:53:52,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:53:52,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:53:52,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:53:52,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:53:52,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:52,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:52,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:53,003 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2023-11-29 03:53:53,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:53,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:53,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:53,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:53,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:53,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:53,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:53:53,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:53:53,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:53:53,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:53:53,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (1/1) ... [2023-11-29 03:53:53,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:53:53,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:53,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:53:53,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 03:53:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:53:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:53:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:53:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:53:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 03:53:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 03:53:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:53:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:53:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:53:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:53:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 03:53:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 03:53:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2023-11-29 03:53:53,089 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2023-11-29 03:53:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2023-11-29 03:53:53,089 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2023-11-29 03:53:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-29 03:53:53,089 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-29 03:53:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2023-11-29 03:53:53,090 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2023-11-29 03:53:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:53:53,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:53:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:53:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:53:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 03:53:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 03:53:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 03:53:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:53:53,192 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:53:53,194 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:53:53,402 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:53:53,411 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:53:53,411 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 03:53:53,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:53:53 BoogieIcfgContainer [2023-11-29 03:53:53,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:53:53,414 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 03:53:53,414 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 03:53:53,418 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 03:53:53,419 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 03:53:53,419 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 03:53:52" (1/3) ... [2023-11-29 03:53:53,420 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@132b2673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 03:53:53, skipping insertion in model container [2023-11-29 03:53:53,420 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 03:53:53,420 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:53:52" (2/3) ... [2023-11-29 03:53:53,420 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@132b2673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 03:53:53, skipping insertion in model container [2023-11-29 03:53:53,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 03:53:53,421 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:53:53" (3/3) ... [2023-11-29 03:53:53,422 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_4.c [2023-11-29 03:53:53,470 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 03:53:53,470 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 03:53:53,470 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 03:53:53,470 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 03:53:53,470 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 03:53:53,470 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 03:53:53,471 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 03:53:53,471 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 03:53:53,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 03:53:53,492 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:53:53,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:53:53,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:53:53,497 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:53:53,498 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:53,498 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 03:53:53,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 03:53:53,502 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:53:53,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:53:53,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:53:53,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:53:53,503 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:53,509 INFO L748 eck$LassoCheckResult]: Stem: 37#$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); 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 29#L107true call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 33#$Ultimate##0true [2023-11-29 03:53:53,509 INFO L750 eck$LassoCheckResult]: Loop: 33#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 10#L81true assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 21#L87true call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 24#L61true assume !(#t~mem10 < 6);havoc #t~mem10; 6#L61-1true assume true; 9#func_to_recursive_line_23_to_24_0EXITtrue >#88#return; 15#L87-1true call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 7#L92true call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 33#$Ultimate##0true [2023-11-29 03:53:53,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 1 times [2023-11-29 03:53:53,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:53,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163978533] [2023-11-29 03:53:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:53,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:53:53,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:53:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:53:53,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:53:53,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash -448633028, now seen corresponding path program 1 times [2023-11-29 03:53:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858530218] [2023-11-29 03:53:53,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:53,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:54,027 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 03:53:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858530218] [2023-11-29 03:53:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858530218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:54,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:54,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:53:54,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055211123] [2023-11-29 03:53:54,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:54,033 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 03:53:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:54,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:53:54,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:53:54,066 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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 03:53:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:54,271 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2023-11-29 03:53:54,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2023-11-29 03:53:54,277 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:53:54,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 33 states and 41 transitions. [2023-11-29 03:53:54,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-29 03:53:54,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2023-11-29 03:53:54,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2023-11-29 03:53:54,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:53:54,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2023-11-29 03:53:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2023-11-29 03:53:54,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2023-11-29 03:53:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 03:53:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-29 03:53:54,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-29 03:53:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:53:54,314 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-29 03:53:54,314 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 03:53:54,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2023-11-29 03:53:54,316 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:53:54,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:53:54,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:53:54,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:53:54,317 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 03:53:54,317 INFO L748 eck$LassoCheckResult]: Stem: 136#$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); 124#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 120#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 121#$Ultimate##0 [2023-11-29 03:53:54,317 INFO L750 eck$LassoCheckResult]: Loop: 121#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 123#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 110#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 131#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 113#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 125#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 112#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 116#L41-1 assume true; 132#func_to_recursive_line_24_to_25_0EXIT >#84#return; 134#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 109#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 131#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 117#L61-1 assume true; 118#func_to_recursive_line_23_to_24_0EXIT >#86#return; 122#L61-1 assume true; 137#func_to_recursive_line_23_to_24_0EXIT >#88#return; 128#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 119#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 121#$Ultimate##0 [2023-11-29 03:53:54,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 2 times [2023-11-29 03:53:54,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:54,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143043529] [2023-11-29 03:53:54,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:53:54,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:53:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:53:54,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:53:54,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:54,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1860565822, now seen corresponding path program 1 times [2023-11-29 03:53:54,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:54,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599659412] [2023-11-29 03:53:54,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:54,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:54,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:54,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:54,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:53:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:54,649 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 03:53:54,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:54,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599659412] [2023-11-29 03:53:54,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599659412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:54,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:54,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:53:54,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513318118] [2023-11-29 03:53:54,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:54,651 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 03:53:54,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:54,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:53:54,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:53:54,652 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 10 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 03:53:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:54,786 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2023-11-29 03:53:54,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2023-11-29 03:53:54,788 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:53:54,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2023-11-29 03:53:54,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-29 03:53:54,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2023-11-29 03:53:54,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2023-11-29 03:53:54,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:53:54,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-11-29 03:53:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2023-11-29 03:53:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-29 03:53:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-29 03:53:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-29 03:53:54,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-29 03:53:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:53:54,797 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-29 03:53:54,797 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 03:53:54,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2023-11-29 03:53:54,798 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:53:54,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:53:54,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:53:54,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:53:54,799 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, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:54,800 INFO L748 eck$LassoCheckResult]: Stem: 237#$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); 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 219#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 220#$Ultimate##0 [2023-11-29 03:53:54,800 INFO L750 eck$LassoCheckResult]: Loop: 220#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 222#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 209#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 210#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 230#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 212#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 224#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 211#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 214#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 226#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 235#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 228#L25-1 assume true; 229#func_to_recursive_line_25_to_25_0EXIT >#80#return; 233#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 213#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 224#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 211#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 215#L41-1 assume true; 236#func_to_recursive_line_24_to_25_0EXIT >#82#return; 231#L41-1 assume true; 232#func_to_recursive_line_24_to_25_0EXIT >#84#return; 234#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 208#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 210#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 230#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 216#L61-1 assume true; 217#func_to_recursive_line_23_to_24_0EXIT >#86#return; 221#L61-1 assume true; 238#func_to_recursive_line_23_to_24_0EXIT >#88#return; 227#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 218#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 220#$Ultimate##0 [2023-11-29 03:53:54,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 3 times [2023-11-29 03:53:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:54,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81141908] [2023-11-29 03:53:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:53:54,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:53:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:53:54,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:53:54,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1780666575, now seen corresponding path program 1 times [2023-11-29 03:53:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:54,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973287723] [2023-11-29 03:53:54,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:54,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:54,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:53:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:53:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 03:53:55,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:55,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973287723] [2023-11-29 03:53:55,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973287723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:55,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:55,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:53:55,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269803323] [2023-11-29 03:53:55,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:55,160 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 03:53:55,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:55,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:53:55,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:53:55,161 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 03:53:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:55,289 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-11-29 03:53:55,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2023-11-29 03:53:55,291 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:53:55,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2023-11-29 03:53:55,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-29 03:53:55,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2023-11-29 03:53:55,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2023-11-29 03:53:55,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:53:55,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-29 03:53:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2023-11-29 03:53:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-29 03:53:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 22 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-29 03:53:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-29 03:53:55,298 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-29 03:53:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:53:55,300 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-29 03:53:55,300 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 03:53:55,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2023-11-29 03:53:55,301 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:53:55,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:53:55,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:53:55,302 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:53:55,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:55,303 INFO L748 eck$LassoCheckResult]: Stem: 369#$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); 355#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 351#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 352#$Ultimate##0 [2023-11-29 03:53:55,303 INFO L750 eck$LassoCheckResult]: Loop: 352#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 354#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 341#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 342#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 362#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 344#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 356#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 343#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 346#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 358#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 367#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 357#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 358#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 367#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 360#L25-1 assume true; 361#func_to_recursive_line_25_to_25_0EXIT >#92#return; 364#L25-1 assume true; 370#func_to_recursive_line_25_to_25_0EXIT >#80#return; 365#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 345#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 356#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 343#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 347#L41-1 assume true; 363#func_to_recursive_line_24_to_25_0EXIT >#82#return; 368#L41-1 assume true; 372#func_to_recursive_line_24_to_25_0EXIT >#84#return; 366#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 340#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 342#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 362#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 348#L61-1 assume true; 349#func_to_recursive_line_23_to_24_0EXIT >#86#return; 353#L61-1 assume true; 371#func_to_recursive_line_23_to_24_0EXIT >#88#return; 359#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 350#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 352#$Ultimate##0 [2023-11-29 03:53:55,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 4 times [2023-11-29 03:53:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106231677] [2023-11-29 03:53:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:53:55,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:53:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:53:55,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:53:55,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash -971158242, now seen corresponding path program 1 times [2023-11-29 03:53:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:55,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941281091] [2023-11-29 03:53:55,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:55,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:53:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:53:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:53:55,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:55,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941281091] [2023-11-29 03:53:55,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941281091] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113606853] [2023-11-29 03:53:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:55,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:55,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:55,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:55,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:53:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:56,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 03:53:56,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:56,183 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 03:53:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:53:56,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:53:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 03:53:57,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113606853] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:53:57,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:53:57,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2023-11-29 03:53:57,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845634545] [2023-11-29 03:53:57,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:53:57,111 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 03:53:57,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:57,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 03:53:57,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:53:57,113 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand has 26 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (13), 4 states have call predecessors, (13), 9 states have call successors, (13) [2023-11-29 03:53:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:57,575 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2023-11-29 03:53:57,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2023-11-29 03:53:57,576 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:53:57,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 43 transitions. [2023-11-29 03:53:57,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-29 03:53:57,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-29 03:53:57,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2023-11-29 03:53:57,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:53:57,579 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-11-29 03:53:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2023-11-29 03:53:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-29 03:53:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-29 03:53:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-11-29 03:53:57,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-11-29 03:53:57,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:53:57,585 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-11-29 03:53:57,585 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 03:53:57,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2023-11-29 03:53:57,586 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:53:57,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:53:57,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:53:57,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:53:57,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:57,588 INFO L748 eck$LassoCheckResult]: Stem: 767#$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); 752#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 748#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 749#$Ultimate##0 [2023-11-29 03:53:57,588 INFO L750 eck$LassoCheckResult]: Loop: 749#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 751#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 738#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 739#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 759#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 742#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 753#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 740#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 743#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 755#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 766#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 754#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 755#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 766#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 754#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 755#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 766#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 754#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 755#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 766#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 757#L25-1 assume true; 758#func_to_recursive_line_25_to_25_0EXIT >#92#return; 762#L25-1 assume true; 773#func_to_recursive_line_25_to_25_0EXIT >#92#return; 772#L25-1 assume true; 771#func_to_recursive_line_25_to_25_0EXIT >#92#return; 769#L25-1 assume true; 768#func_to_recursive_line_25_to_25_0EXIT >#80#return; 763#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 741#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 753#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 740#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 744#L41-1 assume true; 765#func_to_recursive_line_24_to_25_0EXIT >#82#return; 760#L41-1 assume true; 761#func_to_recursive_line_24_to_25_0EXIT >#84#return; 764#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 737#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 739#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 759#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 745#L61-1 assume true; 746#func_to_recursive_line_23_to_24_0EXIT >#86#return; 750#L61-1 assume true; 770#func_to_recursive_line_23_to_24_0EXIT >#88#return; 756#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 747#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 749#$Ultimate##0 [2023-11-29 03:53:57,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 5 times [2023-11-29 03:53:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795142578] [2023-11-29 03:53:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:53:57,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:53:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:53:57,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:53:57,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:57,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2092880572, now seen corresponding path program 2 times [2023-11-29 03:53:57,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:57,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780562598] [2023-11-29 03:53:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:58,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:58,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:58,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:58,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:53:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:59,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 03:53:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:59,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 03:53:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 03:53:59,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780562598] [2023-11-29 03:53:59,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780562598] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893896162] [2023-11-29 03:53:59,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:53:59,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:59,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:59,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:59,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:53:59,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:53:59,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:53:59,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 03:53:59,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:59,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 03:53:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 03:53:59,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:54:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 03:54:01,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893896162] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:54:01,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:54:01,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 18] total 39 [2023-11-29 03:54:01,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467217402] [2023-11-29 03:54:01,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:54:01,210 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 03:54:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:54:01,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 03:54:01,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1237, Unknown=0, NotChecked=0, Total=1482 [2023-11-29 03:54:01,212 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. cyclomatic complexity: 10 Second operand has 39 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 32 states have internal predecessors, (54), 13 states have call successors, (21), 9 states have call predecessors, (21), 11 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2023-11-29 03:54:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:54:01,745 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-11-29 03:54:01,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2023-11-29 03:54:01,747 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:01,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2023-11-29 03:54:01,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2023-11-29 03:54:01,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-11-29 03:54:01,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2023-11-29 03:54:01,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:54:01,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-29 03:54:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2023-11-29 03:54:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-29 03:54:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (13), 10 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-29 03:54:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-11-29 03:54:01,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-29 03:54:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:54:01,754 INFO L428 stractBuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-29 03:54:01,754 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 03:54:01,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2023-11-29 03:54:01,755 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:01,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:54:01,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:54:01,757 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:54:01,757 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:54:01,757 INFO L748 eck$LassoCheckResult]: Stem: 1301#$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); 1287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1283#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1284#$Ultimate##0 [2023-11-29 03:54:01,757 INFO L750 eck$LassoCheckResult]: Loop: 1284#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 1286#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 1273#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1274#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 1294#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 1276#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1288#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 1275#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 1278#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1300#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1289#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1300#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1289#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1300#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1289#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1300#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1289#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1300#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1289#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1300#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1292#L25-1 assume true; 1293#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1296#L25-1 assume true; 1312#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1311#L25-1 assume true; 1310#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1309#L25-1 assume true; 1308#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1306#L25-1 assume true; 1305#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1303#L25-1 assume true; 1302#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1297#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1277#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1288#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 1275#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1279#L41-1 assume true; 1295#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1299#L41-1 assume true; 1307#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1298#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1272#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1274#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 1294#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1280#L61-1 assume true; 1281#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1285#L61-1 assume true; 1304#func_to_recursive_line_23_to_24_0EXIT >#88#return; 1291#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1282#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 1284#$Ultimate##0 [2023-11-29 03:54:01,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:01,757 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 6 times [2023-11-29 03:54:01,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:01,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888256474] [2023-11-29 03:54:01,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:01,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:01,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:54:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:01,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:54:01,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:01,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1778629226, now seen corresponding path program 3 times [2023-11-29 03:54:01,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:01,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367855685] [2023-11-29 03:54:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:01,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:02,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:02,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:03,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:03,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:03,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:03,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:04,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:04,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:04,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 03:54:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:54:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 03:54:04,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:54:04,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367855685] [2023-11-29 03:54:04,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367855685] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:54:04,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563472360] [2023-11-29 03:54:04,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:54:04,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:54:04,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:54:04,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:54:04,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:54:04,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 03:54:04,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:54:04,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 03:54:04,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:54:04,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:54:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 03:54:04,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:54:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-29 03:54:04,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563472360] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:54:04,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:54:04,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 10] total 32 [2023-11-29 03:54:04,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141992441] [2023-11-29 03:54:04,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:54:04,881 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 03:54:04,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:54:04,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 03:54:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2023-11-29 03:54:04,883 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 10 Second operand has 32 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 11 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2023-11-29 03:54:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:54:05,458 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2023-11-29 03:54:05,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2023-11-29 03:54:05,460 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:05,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 51 transitions. [2023-11-29 03:54:05,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-11-29 03:54:05,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-11-29 03:54:05,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2023-11-29 03:54:05,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:54:05,462 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-11-29 03:54:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2023-11-29 03:54:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-29 03:54:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 12 states have return successors, (15), 12 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-29 03:54:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-11-29 03:54:05,468 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-11-29 03:54:05,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:54:05,469 INFO L428 stractBuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-11-29 03:54:05,469 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 03:54:05,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2023-11-29 03:54:05,470 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:05,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:54:05,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:54:05,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:54:05,474 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 12, 12, 12, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:54:05,474 INFO L748 eck$LassoCheckResult]: Stem: 1978#$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); 1965#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1961#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1962#$Ultimate##0 [2023-11-29 03:54:05,474 INFO L750 eck$LassoCheckResult]: Loop: 1962#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 1964#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 1951#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1952#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 1972#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 1955#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1966#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 1953#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 1956#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1970#L25-1 assume true; 1971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1974#L25-1 assume true; 1994#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1993#L25-1 assume true; 1992#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1990#L25-1 assume true; 1989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1988#L25-1 assume true; 1987#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1986#L25-1 assume true; 1985#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1983#L25-1 assume true; 1982#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1975#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1954#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1966#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 1953#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1957#L41-1 assume true; 1973#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1977#L41-1 assume true; 1991#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1976#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1950#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1952#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 1972#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 1955#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1966#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 1953#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 1956#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1968#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1979#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1970#L25-1 assume true; 1971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1974#L25-1 assume true; 1994#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1993#L25-1 assume true; 1992#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1990#L25-1 assume true; 1989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1988#L25-1 assume true; 1987#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1986#L25-1 assume true; 1985#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1983#L25-1 assume true; 1982#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1975#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1954#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1966#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 1953#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1957#L41-1 assume true; 1973#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1977#L41-1 assume true; 1991#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1976#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1950#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1952#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 1972#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1958#L61-1 assume true; 1959#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1963#L61-1 assume true; 1984#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1981#L61-1 assume true; 1980#func_to_recursive_line_23_to_24_0EXIT >#88#return; 1967#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1960#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 1962#$Ultimate##0 [2023-11-29 03:54:05,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 7 times [2023-11-29 03:54:05,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:05,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445424630] [2023-11-29 03:54:05,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:05,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:05,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:54:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:05,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:54:05,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash -348181174, now seen corresponding path program 4 times [2023-11-29 03:54:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:05,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578978961] [2023-11-29 03:54:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:05,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:54:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:54:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2023-11-29 03:54:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:54:06,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578978961] [2023-11-29 03:54:06,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578978961] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:54:06,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506430307] [2023-11-29 03:54:06,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 03:54:06,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:54:06,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:54:06,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:54:06,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:54:06,841 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 03:54:06,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:54:06,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 03:54:06,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:54:06,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:54:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2023-11-29 03:54:07,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:54:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2023-11-29 03:54:07,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506430307] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:54:07,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:54:07,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 14] total 31 [2023-11-29 03:54:07,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179319755] [2023-11-29 03:54:07,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:54:07,840 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 03:54:07,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:54:07,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 03:54:07,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2023-11-29 03:54:07,842 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 10 Second operand has 31 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 13 states have call successors, (22), 9 states have call predecessors, (22), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2023-11-29 03:54:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:54:08,333 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-11-29 03:54:08,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2023-11-29 03:54:08,334 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:08,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 55 transitions. [2023-11-29 03:54:08,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2023-11-29 03:54:08,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2023-11-29 03:54:08,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2023-11-29 03:54:08,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:54:08,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-11-29 03:54:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2023-11-29 03:54:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 03:54:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 30 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 14 states have return successors, (17), 14 states have call predecessors, (17), 6 states have call successors, (17) [2023-11-29 03:54:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-11-29 03:54:08,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-11-29 03:54:08,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:54:08,343 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-11-29 03:54:08,343 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-29 03:54:08,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 55 transitions. [2023-11-29 03:54:08,344 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:08,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:54:08,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:54:08,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:54:08,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:54:08,349 INFO L748 eck$LassoCheckResult]: Stem: 3331#$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); 3317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3313#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 3314#$Ultimate##0 [2023-11-29 03:54:08,350 INFO L750 eck$LassoCheckResult]: Loop: 3314#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 3316#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 3303#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3304#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 3324#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 3306#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3305#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3308#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3322#L25-1 assume true; 3323#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3328#L25-1 assume true; 3350#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3347#L25-1 assume true; 3344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3343#L25-1 assume true; 3342#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3340#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3335#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3329#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3307#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3305#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3308#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3322#L25-1 assume true; 3323#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3328#L25-1 assume true; 3350#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3347#L25-1 assume true; 3344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3343#L25-1 assume true; 3342#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3340#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3335#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3329#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3307#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3305#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3309#L41-1 assume true; 3332#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3325#L41-1 assume true; 3326#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3346#L41-1 assume true; 3345#func_to_recursive_line_24_to_25_0EXIT >#84#return; 3330#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 3302#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3304#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 3324#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 3306#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3305#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3308#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3322#L25-1 assume true; 3323#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3328#L25-1 assume true; 3350#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3347#L25-1 assume true; 3344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3343#L25-1 assume true; 3342#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3340#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3335#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3329#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3307#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3305#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3308#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3322#L25-1 assume true; 3323#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3328#L25-1 assume true; 3350#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3347#L25-1 assume true; 3344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3343#L25-1 assume true; 3342#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3340#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3335#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3329#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3307#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3305#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3309#L41-1 assume true; 3332#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3325#L41-1 assume true; 3326#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3346#L41-1 assume true; 3345#func_to_recursive_line_24_to_25_0EXIT >#84#return; 3330#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 3302#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3304#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 3324#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 3306#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3305#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3308#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3322#L25-1 assume true; 3323#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3328#L25-1 assume true; 3350#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3347#L25-1 assume true; 3344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3343#L25-1 assume true; 3342#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3340#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3335#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3329#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3307#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3305#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3308#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3319#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3333#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3322#L25-1 assume true; 3323#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3328#L25-1 assume true; 3350#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3347#L25-1 assume true; 3344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3343#L25-1 assume true; 3342#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3340#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3335#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3329#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3307#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3305#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3309#L41-1 assume true; 3332#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3325#L41-1 assume true; 3326#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3346#L41-1 assume true; 3345#func_to_recursive_line_24_to_25_0EXIT >#84#return; 3330#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 3302#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3304#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 3324#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3327#L61-1 assume true; 3315#func_to_recursive_line_23_to_24_0EXIT >#86#return; 3310#L61-1 assume true; 3311#func_to_recursive_line_23_to_24_0EXIT >#86#return; 3341#L61-1 assume true; 3339#func_to_recursive_line_23_to_24_0EXIT >#86#return; 3337#L61-1 assume true; 3336#func_to_recursive_line_23_to_24_0EXIT >#88#return; 3321#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 3312#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 3314#$Ultimate##0 [2023-11-29 03:54:08,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 8 times [2023-11-29 03:54:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:08,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853074478] [2023-11-29 03:54:08,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:08,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:54:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:08,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:54:08,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash 732034000, now seen corresponding path program 5 times [2023-11-29 03:54:08,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:08,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716149424] [2023-11-29 03:54:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:08,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:09,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 03:54:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 03:54:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 03:54:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 7 proven. 95 refuted. 0 times theorem prover too weak. 4194 trivial. 0 not checked. [2023-11-29 03:54:12,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:54:12,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716149424] [2023-11-29 03:54:12,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716149424] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:54:12,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491072828] [2023-11-29 03:54:12,304 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:54:12,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:54:12,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:54:12,308 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:54:12,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:54:16,121 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-11-29 03:54:16,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:54:16,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 1526 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 03:54:16,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:54:16,145 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 03:54:16,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:54:16,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:54:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 1960 proven. 8 refuted. 0 times theorem prover too weak. 2328 trivial. 0 not checked. [2023-11-29 03:54:16,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:54:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 6 proven. 117 refuted. 0 times theorem prover too weak. 4173 trivial. 0 not checked. [2023-11-29 03:54:17,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491072828] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:54:17,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:54:17,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 14] total 33 [2023-11-29 03:54:17,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853505815] [2023-11-29 03:54:17,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:54:17,671 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 03:54:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:54:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 03:54:17,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 03:54:17,672 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. cyclomatic complexity: 10 Second operand has 33 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 14 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2023-11-29 03:54:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:54:18,052 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2023-11-29 03:54:18,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 59 transitions. [2023-11-29 03:54:18,053 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:18,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 59 transitions. [2023-11-29 03:54:18,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2023-11-29 03:54:18,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2023-11-29 03:54:18,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 59 transitions. [2023-11-29 03:54:18,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:54:18,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-11-29 03:54:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 59 transitions. [2023-11-29 03:54:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-29 03:54:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.103448275862069) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (19), 16 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-29 03:54:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-11-29 03:54:18,061 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-11-29 03:54:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 03:54:18,062 INFO L428 stractBuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-11-29 03:54:18,062 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-29 03:54:18,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2023-11-29 03:54:18,063 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:18,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:54:18,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:54:18,069 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:54:18,069 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [84, 84, 72, 72, 72, 15, 15, 12, 12, 12, 12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:54:18,069 INFO L748 eck$LassoCheckResult]: Stem: 6982#$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); 6968#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 6964#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 6965#$Ultimate##0 [2023-11-29 03:54:18,070 INFO L750 eck$LassoCheckResult]: Loop: 6965#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 6967#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 6954#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6955#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 6975#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 6958#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6960#L41-1 assume true; 6976#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6981#L41-1 assume true; 7005#func_to_recursive_line_24_to_25_0EXIT >#82#return; 7004#L41-1 assume true; 7003#func_to_recursive_line_24_to_25_0EXIT >#82#return; 7002#L41-1 assume true; 7000#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6997#L41-1 assume true; 6996#func_to_recursive_line_24_to_25_0EXIT >#84#return; 6980#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 6953#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6955#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 6975#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 6958#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6960#L41-1 assume true; 6976#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6981#L41-1 assume true; 7005#func_to_recursive_line_24_to_25_0EXIT >#82#return; 7004#L41-1 assume true; 7003#func_to_recursive_line_24_to_25_0EXIT >#82#return; 7002#L41-1 assume true; 7000#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6997#L41-1 assume true; 6996#func_to_recursive_line_24_to_25_0EXIT >#84#return; 6980#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 6953#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6955#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 6975#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 6958#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6959#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6970#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6971#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6983#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6984#L25-1 assume true; 6978#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6973#L25-1 assume true; 6974#func_to_recursive_line_25_to_25_0EXIT >#92#return; 7001#L25-1 assume true; 6999#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6998#L25-1 assume true; 6995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6994#L25-1 assume true; 6993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6991#L25-1 assume true; 6989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6986#L25-1 assume true; 6985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6979#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6957#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6969#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 6956#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6960#L41-1 assume true; 6976#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6981#L41-1 assume true; 7005#func_to_recursive_line_24_to_25_0EXIT >#82#return; 7004#L41-1 assume true; 7003#func_to_recursive_line_24_to_25_0EXIT >#82#return; 7002#L41-1 assume true; 7000#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6997#L41-1 assume true; 6996#func_to_recursive_line_24_to_25_0EXIT >#84#return; 6980#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 6953#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6955#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 6975#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6977#L61-1 assume true; 6966#func_to_recursive_line_23_to_24_0EXIT >#86#return; 6961#L61-1 assume true; 6962#func_to_recursive_line_23_to_24_0EXIT >#86#return; 6992#L61-1 assume true; 6990#func_to_recursive_line_23_to_24_0EXIT >#86#return; 6988#L61-1 assume true; 6987#func_to_recursive_line_23_to_24_0EXIT >#88#return; 6972#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 6963#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 6965#$Ultimate##0 [2023-11-29 03:54:18,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 9 times [2023-11-29 03:54:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:18,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178950330] [2023-11-29 03:54:18,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:18,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:18,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:54:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:18,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:54:18,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash 24421248, now seen corresponding path program 6 times [2023-11-29 03:54:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:18,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683736350] [2023-11-29 03:54:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:21,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:24,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:24,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:24,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:24,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:24,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:24,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 03:54:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 03:54:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 03:54:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 18 proven. 276 refuted. 0 times theorem prover too weak. 16857 trivial. 0 not checked. [2023-11-29 03:54:26,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:54:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683736350] [2023-11-29 03:54:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683736350] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:54:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406862426] [2023-11-29 03:54:26,705 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 03:54:26,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:54:26,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:54:26,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:54:26,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:54:27,068 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-11-29 03:54:27,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:54:27,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-29 03:54:27,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:54:27,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:54:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 17136 trivial. 0 not checked. [2023-11-29 03:54:27,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:54:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 17118 trivial. 0 not checked. [2023-11-29 03:54:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406862426] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:54:29,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:54:29,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 18] total 41 [2023-11-29 03:54:29,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415970987] [2023-11-29 03:54:29,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:54:29,753 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 03:54:29,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:54:29,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 03:54:29,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 03:54:29,755 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. cyclomatic complexity: 10 Second operand has 41 states, 32 states have (on average 1.90625) internal successors, (61), 33 states have internal predecessors, (61), 17 states have call successors, (26), 10 states have call predecessors, (26), 15 states have return successors, (26), 18 states have call predecessors, (26), 17 states have call successors, (26) [2023-11-29 03:54:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:54:30,364 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-11-29 03:54:30,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 63 transitions. [2023-11-29 03:54:30,365 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:30,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 63 transitions. [2023-11-29 03:54:30,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2023-11-29 03:54:30,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2023-11-29 03:54:30,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 63 transitions. [2023-11-29 03:54:30,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:54:30,366 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 63 transitions. [2023-11-29 03:54:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 63 transitions. [2023-11-29 03:54:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-29 03:54:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.096774193548387) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 18 states have return successors, (21), 18 states have call predecessors, (21), 6 states have call successors, (21) [2023-11-29 03:54:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2023-11-29 03:54:30,370 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 63 transitions. [2023-11-29 03:54:30,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 03:54:30,371 INFO L428 stractBuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2023-11-29 03:54:30,371 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-29 03:54:30,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 63 transitions. [2023-11-29 03:54:30,372 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:30,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:54:30,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:54:30,378 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:54:30,378 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [140, 140, 120, 120, 120, 24, 24, 20, 20, 20, 20, 20, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:54:30,379 INFO L748 eck$LassoCheckResult]: Stem: 14312#$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); 14298#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 14294#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 14295#$Ultimate##0 [2023-11-29 03:54:30,379 INFO L750 eck$LassoCheckResult]: Loop: 14295#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 14297#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 14284#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14285#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 14305#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 14287#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14290#L41-1 assume true; 14306#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14310#L41-1 assume true; 14339#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14338#L41-1 assume true; 14337#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14336#L41-1 assume true; 14335#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14333#L41-1 assume true; 14330#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14328#L41-1 assume true; 14327#func_to_recursive_line_24_to_25_0EXIT >#84#return; 14309#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 14283#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14285#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 14305#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 14287#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14290#L41-1 assume true; 14306#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14310#L41-1 assume true; 14339#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14338#L41-1 assume true; 14337#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14336#L41-1 assume true; 14335#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14333#L41-1 assume true; 14330#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14328#L41-1 assume true; 14327#func_to_recursive_line_24_to_25_0EXIT >#84#return; 14309#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 14283#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14285#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 14305#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 14287#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14290#L41-1 assume true; 14306#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14310#L41-1 assume true; 14339#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14338#L41-1 assume true; 14337#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14336#L41-1 assume true; 14335#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14333#L41-1 assume true; 14330#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14328#L41-1 assume true; 14327#func_to_recursive_line_24_to_25_0EXIT >#84#return; 14309#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 14283#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14285#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 14305#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 14287#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 14289#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 14300#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 14301#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 14311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14303#L25-1 assume true; 14304#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14307#L25-1 assume true; 14334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14332#L25-1 assume true; 14331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14329#L25-1 assume true; 14325#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14323#L25-1 assume true; 14321#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14319#L25-1 assume true; 14317#func_to_recursive_line_25_to_25_0EXIT >#92#return; 14314#L25-1 assume true; 14313#func_to_recursive_line_25_to_25_0EXIT >#80#return; 14308#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 14288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 14299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 14286#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14290#L41-1 assume true; 14306#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14310#L41-1 assume true; 14339#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14338#L41-1 assume true; 14337#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14336#L41-1 assume true; 14335#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14333#L41-1 assume true; 14330#func_to_recursive_line_24_to_25_0EXIT >#82#return; 14328#L41-1 assume true; 14327#func_to_recursive_line_24_to_25_0EXIT >#84#return; 14309#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 14283#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14285#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 14305#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 14291#L61-1 assume true; 14292#func_to_recursive_line_23_to_24_0EXIT >#86#return; 14296#L61-1 assume true; 14326#func_to_recursive_line_23_to_24_0EXIT >#86#return; 14324#L61-1 assume true; 14322#func_to_recursive_line_23_to_24_0EXIT >#86#return; 14320#L61-1 assume true; 14318#func_to_recursive_line_23_to_24_0EXIT >#86#return; 14316#L61-1 assume true; 14315#func_to_recursive_line_23_to_24_0EXIT >#88#return; 14302#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 14293#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 14295#$Ultimate##0 [2023-11-29 03:54:30,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 10 times [2023-11-29 03:54:30,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:30,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469850829] [2023-11-29 03:54:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:30,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:54:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:30,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:54:30,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:30,397 INFO L85 PathProgramCache]: Analyzing trace with hash -531250216, now seen corresponding path program 7 times [2023-11-29 03:54:30,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:30,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430761504] [2023-11-29 03:54:30,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:30,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:43,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:44,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:45,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:45,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:45,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:45,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:45,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-29 03:54:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:47,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-29 03:54:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-29 03:54:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:54:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:54:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-29 03:54:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 47792 backedges. 8 proven. 633 refuted. 0 times theorem prover too weak. 47151 trivial. 0 not checked. [2023-11-29 03:54:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:54:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430761504] [2023-11-29 03:54:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430761504] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:54:48,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137960661] [2023-11-29 03:54:48,956 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 03:54:48,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:54:48,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:54:48,957 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:54:48,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:54:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:54:49,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 4960 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 03:54:49,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:54:49,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:54:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 47792 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 47768 trivial. 0 not checked. [2023-11-29 03:54:50,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:54:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 47792 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 47734 trivial. 0 not checked. [2023-11-29 03:54:54,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137960661] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:54:54,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:54:54,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12, 22] total 58 [2023-11-29 03:54:54,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685104121] [2023-11-29 03:54:54,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:54:54,441 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 03:54:54,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:54:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-29 03:54:54,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=3009, Unknown=0, NotChecked=0, Total=3306 [2023-11-29 03:54:54,443 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. cyclomatic complexity: 10 Second operand has 58 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 49 states have internal predecessors, (76), 25 states have call successors, (34), 11 states have call predecessors, (34), 18 states have return successors, (33), 25 states have call predecessors, (33), 25 states have call successors, (33) [2023-11-29 03:54:55,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:54:55,886 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2023-11-29 03:54:55,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 67 transitions. [2023-11-29 03:54:55,887 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:55,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 67 transitions. [2023-11-29 03:54:55,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2023-11-29 03:54:55,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2023-11-29 03:54:55,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 67 transitions. [2023-11-29 03:54:55,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:54:55,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-11-29 03:54:55,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 67 transitions. [2023-11-29 03:54:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-29 03:54:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 20 states have return successors, (23), 20 states have call predecessors, (23), 6 states have call successors, (23) [2023-11-29 03:54:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2023-11-29 03:54:55,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-11-29 03:54:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:54:55,895 INFO L428 stractBuchiCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-11-29 03:54:55,895 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-29 03:54:55,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 67 transitions. [2023-11-29 03:54:55,896 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:54:55,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:54:55,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:54:55,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:54:55,902 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [210, 210, 180, 180, 180, 35, 35, 30, 30, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:54:55,902 INFO L748 eck$LassoCheckResult]: Stem: 27147#$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); 27133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 27129#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 27130#$Ultimate##0 [2023-11-29 03:54:55,904 INFO L750 eck$LassoCheckResult]: Loop: 27130#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 27132#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 27119#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27120#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 27140#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 27122#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27125#L41-1 assume true; 27148#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27141#L41-1 assume true; 27142#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27178#L41-1 assume true; 27177#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27176#L41-1 assume true; 27175#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27174#L41-1 assume true; 27173#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27172#L41-1 assume true; 27169#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27166#L41-1 assume true; 27165#func_to_recursive_line_24_to_25_0EXIT >#84#return; 27146#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 27118#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27120#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 27140#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 27122#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27125#L41-1 assume true; 27148#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27141#L41-1 assume true; 27142#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27178#L41-1 assume true; 27177#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27176#L41-1 assume true; 27175#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27174#L41-1 assume true; 27173#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27172#L41-1 assume true; 27169#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27166#L41-1 assume true; 27165#func_to_recursive_line_24_to_25_0EXIT >#84#return; 27146#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 27118#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27120#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 27140#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 27122#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27125#L41-1 assume true; 27148#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27141#L41-1 assume true; 27142#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27178#L41-1 assume true; 27177#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27176#L41-1 assume true; 27175#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27174#L41-1 assume true; 27173#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27172#L41-1 assume true; 27169#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27166#L41-1 assume true; 27165#func_to_recursive_line_24_to_25_0EXIT >#84#return; 27146#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 27118#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27120#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 27140#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 27122#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27125#L41-1 assume true; 27148#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27141#L41-1 assume true; 27142#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27178#L41-1 assume true; 27177#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27176#L41-1 assume true; 27175#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27174#L41-1 assume true; 27173#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27172#L41-1 assume true; 27169#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27166#L41-1 assume true; 27165#func_to_recursive_line_24_to_25_0EXIT >#84#return; 27146#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 27118#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27120#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 27140#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 27122#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 27124#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 27135#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 27136#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 27149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27150#L25-1 assume true; 27144#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27138#L25-1 assume true; 27139#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27171#L25-1 assume true; 27170#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27168#L25-1 assume true; 27163#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27161#L25-1 assume true; 27159#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27157#L25-1 assume true; 27155#func_to_recursive_line_25_to_25_0EXIT >#92#return; 27152#L25-1 assume true; 27151#func_to_recursive_line_25_to_25_0EXIT >#80#return; 27145#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 27123#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 27134#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 27121#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27125#L41-1 assume true; 27148#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27141#L41-1 assume true; 27142#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27178#L41-1 assume true; 27177#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27176#L41-1 assume true; 27175#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27174#L41-1 assume true; 27173#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27172#L41-1 assume true; 27169#func_to_recursive_line_24_to_25_0EXIT >#82#return; 27166#L41-1 assume true; 27165#func_to_recursive_line_24_to_25_0EXIT >#84#return; 27146#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 27118#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27120#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 27140#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 27143#L61-1 assume true; 27131#func_to_recursive_line_23_to_24_0EXIT >#86#return; 27126#L61-1 assume true; 27127#func_to_recursive_line_23_to_24_0EXIT >#86#return; 27167#L61-1 assume true; 27164#func_to_recursive_line_23_to_24_0EXIT >#86#return; 27162#L61-1 assume true; 27160#func_to_recursive_line_23_to_24_0EXIT >#86#return; 27158#L61-1 assume true; 27156#func_to_recursive_line_23_to_24_0EXIT >#86#return; 27154#L61-1 assume true; 27153#func_to_recursive_line_23_to_24_0EXIT >#88#return; 27137#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 27128#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 27130#$Ultimate##0 [2023-11-29 03:54:55,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:55,905 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 11 times [2023-11-29 03:54:55,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:55,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813095174] [2023-11-29 03:54:55,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:55,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:55,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:54:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:54:55,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:54:55,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:54:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash 729449042, now seen corresponding path program 8 times [2023-11-29 03:54:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:54:55,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842364064] [2023-11-29 03:54:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:54:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:54:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:08,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:17,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 03:55:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:24,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 03:55:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:28,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 03:55:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:30,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 03:55:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:55:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:55:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 03:55:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 107665 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 107614 trivial. 0 not checked. [2023-11-29 03:55:32,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:32,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842364064] [2023-11-29 03:55:32,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842364064] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:32,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627846371] [2023-11-29 03:55:32,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:55:32,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:32,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:32,021 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:32,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:55:33,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:55:33,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:55:33,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 7304 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-29 03:55:33,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:33,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:55:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 107665 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 107630 trivial. 0 not checked. [2023-11-29 03:55:34,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:55:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 107665 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 107575 trivial. 0 not checked. [2023-11-29 03:55:39,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627846371] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:55:39,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:55:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 26] total 45 [2023-11-29 03:55:39,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285140112] [2023-11-29 03:55:39,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:55:39,372 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 03:55:39,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:39,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 03:55:39,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1625, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 03:55:39,374 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. cyclomatic complexity: 10 Second operand has 45 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 19 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (28), 20 states have call predecessors, (28), 18 states have call successors, (28) [2023-11-29 03:55:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:39,979 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-11-29 03:55:39,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 69 transitions. [2023-11-29 03:55:39,980 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:55:39,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 69 transitions. [2023-11-29 03:55:39,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2023-11-29 03:55:39,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-11-29 03:55:39,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 69 transitions. [2023-11-29 03:55:39,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:55:39,982 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 69 transitions. [2023-11-29 03:55:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 69 transitions. [2023-11-29 03:55:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-29 03:55:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 1.088235294117647) internal successors, (37), 37 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 21 states have return successors, (24), 21 states have call predecessors, (24), 6 states have call successors, (24) [2023-11-29 03:55:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2023-11-29 03:55:39,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 69 transitions. [2023-11-29 03:55:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:55:39,989 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 69 transitions. [2023-11-29 03:55:39,989 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-29 03:55:39,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 69 transitions. [2023-11-29 03:55:39,990 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 03:55:39,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:55:39,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:55:39,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-29 03:55:39,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [252, 252, 216, 216, 216, 42, 42, 36, 36, 36, 36, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:55:39,998 INFO L748 eck$LassoCheckResult]: Stem: 47407#$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); 47395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 47391#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 47392#$Ultimate##0 [2023-11-29 03:55:40,000 INFO L750 eck$LassoCheckResult]: Loop: 47392#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 47394#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 47381#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 47382#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 47402#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 47384#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 47387#L41-1 assume true; 47403#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47408#L41-1 assume true; 47442#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47441#L41-1 assume true; 47440#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47439#L41-1 assume true; 47438#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47437#L41-1 assume true; 47436#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47435#L41-1 assume true; 47432#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47429#L41-1 assume true; 47428#func_to_recursive_line_24_to_25_0EXIT >#84#return; 47406#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 47380#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 47382#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 47402#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 47384#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 47387#L41-1 assume true; 47403#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47408#L41-1 assume true; 47442#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47441#L41-1 assume true; 47440#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47439#L41-1 assume true; 47438#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47437#L41-1 assume true; 47436#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47435#L41-1 assume true; 47432#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47429#L41-1 assume true; 47428#func_to_recursive_line_24_to_25_0EXIT >#84#return; 47406#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 47380#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 47382#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 47402#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 47384#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 47387#L41-1 assume true; 47403#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47408#L41-1 assume true; 47442#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47441#L41-1 assume true; 47440#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47439#L41-1 assume true; 47438#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47437#L41-1 assume true; 47436#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47435#L41-1 assume true; 47432#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47429#L41-1 assume true; 47428#func_to_recursive_line_24_to_25_0EXIT >#84#return; 47406#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 47380#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 47382#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 47402#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 47384#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 47387#L41-1 assume true; 47403#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47408#L41-1 assume true; 47442#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47441#L41-1 assume true; 47440#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47439#L41-1 assume true; 47438#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47437#L41-1 assume true; 47436#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47435#L41-1 assume true; 47432#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47429#L41-1 assume true; 47428#func_to_recursive_line_24_to_25_0EXIT >#84#return; 47406#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 47380#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 47382#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 47402#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 47384#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 47387#L41-1 assume true; 47403#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47408#L41-1 assume true; 47442#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47441#L41-1 assume true; 47440#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47439#L41-1 assume true; 47438#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47437#L41-1 assume true; 47436#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47435#L41-1 assume true; 47432#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47429#L41-1 assume true; 47428#func_to_recursive_line_24_to_25_0EXIT >#84#return; 47406#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 47380#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 47382#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 47402#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 47384#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 47386#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 47398#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 47399#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 47409#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 47400#L25-1 assume true; 47401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47404#L25-1 assume true; 47434#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47430#L25-1 assume true; 47427#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47425#L25-1 assume true; 47423#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47421#L25-1 assume true; 47419#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47417#L25-1 assume true; 47415#func_to_recursive_line_25_to_25_0EXIT >#92#return; 47413#L25-1 assume true; 47412#func_to_recursive_line_25_to_25_0EXIT >#80#return; 47405#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 47385#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 47396#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 47383#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 47387#L41-1 assume true; 47403#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47408#L41-1 assume true; 47442#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47441#L41-1 assume true; 47440#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47439#L41-1 assume true; 47438#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47437#L41-1 assume true; 47436#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47435#L41-1 assume true; 47432#func_to_recursive_line_24_to_25_0EXIT >#82#return; 47429#L41-1 assume true; 47428#func_to_recursive_line_24_to_25_0EXIT >#84#return; 47406#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 47380#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 47382#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 47402#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 47388#L61-1 assume true; 47389#func_to_recursive_line_23_to_24_0EXIT >#86#return; 47393#L61-1 assume true; 47433#func_to_recursive_line_23_to_24_0EXIT >#86#return; 47431#L61-1 assume true; 47426#func_to_recursive_line_23_to_24_0EXIT >#86#return; 47424#L61-1 assume true; 47422#func_to_recursive_line_23_to_24_0EXIT >#86#return; 47420#L61-1 assume true; 47418#func_to_recursive_line_23_to_24_0EXIT >#86#return; 47416#L61-1 assume true; 47414#func_to_recursive_line_23_to_24_0EXIT >#86#return; 47411#L61-1 assume true; 47410#func_to_recursive_line_23_to_24_0EXIT >#88#return; 47397#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 47390#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 47392#$Ultimate##0 [2023-11-29 03:55:40,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 12 times [2023-11-29 03:55:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:40,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465811393] [2023-11-29 03:55:40,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:55:40,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:55:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:55:40,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:55:40,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash 815036130, now seen corresponding path program 9 times [2023-11-29 03:55:40,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:40,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809798838] [2023-11-29 03:55:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:40,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:55:41,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:55:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:55:42,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:55:42,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1469748745, now seen corresponding path program 1 times [2023-11-29 03:55:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:42,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531250073] [2023-11-29 03:55:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:42,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:55:43,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:55:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:55:44,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:56:51,133 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 03:56:51,133 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 03:56:51,133 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 03:56:51,133 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 03:56:51,134 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 03:56:51,134 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:51,134 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 03:56:51,134 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 03:56:51,134 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_4.c_Iteration12_Lasso [2023-11-29 03:56:51,134 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 03:56:51,134 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 03:56:51,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 03:56:51,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 03:56:51,153 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 03:56:51,155 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 03:56:51,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 03:56:51,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 03:56:51,158 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 03:56:51,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 03:56:51,161 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 03:56:51,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 03:56:51,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 03:56:51,165 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 03:56:51,166 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 03:56:51,179 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 03:56:51,180 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 03:56:52,388 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 03:56:52,389 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 03:56:52,391 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 03:56:52,392 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 03:56:52,393 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 03:56:52,394 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 03:56:52,395 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 03:56:52,397 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 03:56:52,398 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 03:56:52,399 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 03:56:52,894 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 03:56:52,897 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 03:56:52,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:52,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:52,900 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:52,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-29 03:56:52,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:56:52,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:52,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:56:52,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:52,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:52,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:52,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:56:52,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:56:52,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:52,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-29 03:56:52,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:52,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:52,921 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:52,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-29 03:56:52,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:56:52,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:52,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:56:52,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:52,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:52,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:52,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:56:52,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:56:52,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:52,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-11-29 03:56:52,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:52,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:52,939 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:52,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-29 03:56:52,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:56:52,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:52,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:56:52,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:52,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:52,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:52,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:56:52,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:56:52,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:52,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-11-29 03:56:52,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:52,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:52,959 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:52,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-29 03:56:52,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 03:56:52,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:52,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:56:52,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:52,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:52,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:52,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:56:52,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:56:52,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:52,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-29 03:56:52,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:52,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:52,977 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:52,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-29 03:56:52,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:56:52,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:52,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:56:52,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:52,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:52,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:52,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:56:52,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:56:52,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:52,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-11-29 03:56:52,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:52,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:52,995 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:52,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-29 03:56:52,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:56:53,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:53,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:56:53,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:53,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:53,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:53,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:56:53,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:56:53,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:53,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-11-29 03:56:53,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:53,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:53,014 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:53,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-29 03:56:53,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:56:53,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:53,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:56:53,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:53,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:53,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:53,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:56:53,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:56:53,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:53,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-29 03:56:53,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:53,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:53,032 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:53,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-29 03:56:53,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:56:53,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:53,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:56:53,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:53,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:53,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:53,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:56:53,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:56:53,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:53,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-11-29 03:56:53,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:53,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:53,050 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:53,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-29 03:56:53,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:56:53,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:53,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:56:53,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:53,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:53,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:53,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:56:53,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:56:53,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:53,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-11-29 03:56:53,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:53,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:53,069 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:53,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-29 03:56:53,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:56:53,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:53,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:56:53,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:53,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:53,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:53,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:56:53,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:56:53,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:53,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-11-29 03:56:53,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:53,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:53,088 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:53,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-29 03:56:53,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:56:53,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:53,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:53,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:53,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:53,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:56:53,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:56:53,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:53,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-29 03:56:53,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:53,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:53,110 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:53,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-29 03:56:53,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:56:53,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:53,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:53,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:53,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:53,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:56:53,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:56:53,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:53,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-11-29 03:56:53,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:53,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:53,132 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:53,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-29 03:56:53,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:56:53,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:53,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:56:53,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:53,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:53,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:53,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:56:53,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:56:53,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:53,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-11-29 03:56:53,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:53,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:53,150 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:53,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-29 03:56:53,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:56:53,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:53,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:53,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:53,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:53,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:56:53,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:56:53,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:56:53,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-29 03:56:53,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:53,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:53,172 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:53,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-29 03:56:53,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:56:53,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:56:53,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:56:53,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:56:53,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:56:53,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:56:53,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:56:53,194 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 03:56:53,206 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-11-29 03:56:53,206 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-11-29 03:56:53,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:56:53,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:53,209 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:56:53,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-29 03:56:53,211 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 03:56:53,222 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 03:56:53,222 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 03:56:53,223 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~a.base) func_to_recursive_line_22_to_23_0_#in~a.offset)_1) = -2*v_rep(select (select #memory_int#1 func_to_recursive_line_22_to_23_0_#in~a.base) func_to_recursive_line_22_to_23_0_#in~a.offset)_1 + 11 Supporting invariants [] [2023-11-29 03:56:53,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-11-29 03:56:53,331 INFO L156 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2023-11-29 03:56:53,337 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#in~a!base][#in~a!offset] could not be translated [2023-11-29 03:56:53,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:56:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:53,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:56:53,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:56:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:56,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 17804 conjuncts, 621 conjunts are in the unsatisfiable core [2023-11-29 03:56:56,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:04,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-11-29 03:57:06,024 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 03:57:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 155187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155187 trivial. 0 not checked. [2023-11-29 03:57:06,054 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 03:57:06,055 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 69 transitions. cyclomatic complexity: 10 Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 03:57:06,300 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 69 transitions. cyclomatic complexity: 10. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 169 states and 187 transitions. Complement of second has 19 states. [2023-11-29 03:57:06,301 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 03:57:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 03:57:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2023-11-29 03:57:06,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 3 letters. Loop has 1551 letters. [2023-11-29 03:57:06,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:06,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 1554 letters. Loop has 1551 letters. [2023-11-29 03:57:06,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:06,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 3 letters. Loop has 3102 letters. [2023-11-29 03:57:06,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:06,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 187 transitions. [2023-11-29 03:57:06,351 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 03:57:06,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 125 states and 141 transitions. [2023-11-29 03:57:06,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2023-11-29 03:57:06,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2023-11-29 03:57:06,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 141 transitions. [2023-11-29 03:57:06,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 03:57:06,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 141 transitions. [2023-11-29 03:57:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 141 transitions. [2023-11-29 03:57:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2023-11-29 03:57:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 66 states have internal predecessors, (68), 16 states have call successors, (16), 9 states have call predecessors, (16), 35 states have return successors, (41), 36 states have call predecessors, (41), 12 states have call successors, (41) [2023-11-29 03:57:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2023-11-29 03:57:06,362 INFO L240 hiAutomatonCegarLoop]: Abstraction has 112 states and 125 transitions. [2023-11-29 03:57:06,363 INFO L428 stractBuchiCegarLoop]: Abstraction has 112 states and 125 transitions. [2023-11-29 03:57:06,363 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-29 03:57:06,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 125 transitions. [2023-11-29 03:57:06,364 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 03:57:06,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:57:06,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:57:06,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:57:06,366 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 03:57:06,366 INFO L748 eck$LassoCheckResult]: Stem: 52471#$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); 52447#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 52442#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 52468#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 52444#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 52423#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 52422#$Ultimate##0 [2023-11-29 03:57:06,367 INFO L750 eck$LassoCheckResult]: Loop: 52422#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 52459#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 52428#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 52448#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 52427#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 52430#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 52455#L25-1 assume true; 52456#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52464#L25-1 assume true; 52497#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52495#L25-1 assume true; 52493#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52491#L25-1 assume true; 52489#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52487#L25-1 assume true; 52485#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52483#L25-1 assume true; 52481#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52479#L25-1 assume true; 52478#func_to_recursive_line_25_to_25_0EXIT >#80#return; 52466#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 52429#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 52448#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 52427#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 52430#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 52455#L25-1 assume true; 52456#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52464#L25-1 assume true; 52497#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52495#L25-1 assume true; 52493#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52491#L25-1 assume true; 52489#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52487#L25-1 assume true; 52485#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52483#L25-1 assume true; 52481#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52479#L25-1 assume true; 52478#func_to_recursive_line_25_to_25_0EXIT >#80#return; 52466#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 52429#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 52448#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 52427#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 52430#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 52455#L25-1 assume true; 52456#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52464#L25-1 assume true; 52497#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52495#L25-1 assume true; 52493#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52491#L25-1 assume true; 52489#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52487#L25-1 assume true; 52485#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52483#L25-1 assume true; 52481#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52479#L25-1 assume true; 52478#func_to_recursive_line_25_to_25_0EXIT >#80#return; 52466#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 52429#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 52448#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 52427#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 52430#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 52455#L25-1 assume true; 52456#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52464#L25-1 assume true; 52497#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52495#L25-1 assume true; 52493#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52491#L25-1 assume true; 52489#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52487#L25-1 assume true; 52485#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52483#L25-1 assume true; 52481#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52479#L25-1 assume true; 52478#func_to_recursive_line_25_to_25_0EXIT >#80#return; 52466#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 52429#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 52448#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 52427#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 52430#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 52455#L25-1 assume true; 52456#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52464#L25-1 assume true; 52497#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52495#L25-1 assume true; 52493#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52491#L25-1 assume true; 52489#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52487#L25-1 assume true; 52485#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52483#L25-1 assume true; 52481#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52479#L25-1 assume true; 52478#func_to_recursive_line_25_to_25_0EXIT >#80#return; 52466#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 52429#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 52448#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 52427#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 52430#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 52450#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 52451#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 52474#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 52455#L25-1 assume true; 52456#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52464#L25-1 assume true; 52497#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52495#L25-1 assume true; 52493#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52491#L25-1 assume true; 52489#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52487#L25-1 assume true; 52485#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52483#L25-1 assume true; 52481#func_to_recursive_line_25_to_25_0EXIT >#92#return; 52479#L25-1 assume true; 52478#func_to_recursive_line_25_to_25_0EXIT >#80#return; 52466#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 52429#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 52448#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 52427#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 52431#L41-1 assume true; 52462#func_to_recursive_line_24_to_25_0EXIT >#82#return; 52472#L41-1 assume true; 52525#func_to_recursive_line_24_to_25_0EXIT >#82#return; 52524#L41-1 assume true; 52523#func_to_recursive_line_24_to_25_0EXIT >#82#return; 52522#L41-1 assume true; 52521#func_to_recursive_line_24_to_25_0EXIT >#82#return; 52520#L41-1 assume true; 52519#func_to_recursive_line_24_to_25_0EXIT >#82#return; 52518#L41-1 assume true; 52517#func_to_recursive_line_24_to_25_0EXIT >#82#return; 52516#L41-1 assume true; 52515#func_to_recursive_line_24_to_25_0EXIT >#84#return; 52469#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 52421#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 52422#$Ultimate##0 [2023-11-29 03:57:06,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2133355514, now seen corresponding path program 1 times [2023-11-29 03:57:06,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:06,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504807564] [2023-11-29 03:57:06,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:06,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:06,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:06,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1020259306, now seen corresponding path program 1 times [2023-11-29 03:57:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:06,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851960802] [2023-11-29 03:57:06,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:06,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:06,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:06,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1230169341, now seen corresponding path program 1 times [2023-11-29 03:57:06,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:06,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012217966] [2023-11-29 03:57:06,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:06,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:06,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:06,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:22,943 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 03:57:22,943 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 03:57:22,943 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 03:57:22,943 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 03:57:22,943 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 03:57:22,943 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:22,943 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 03:57:22,943 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 03:57:22,943 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_4.c_Iteration13_Lasso [2023-11-29 03:57:22,943 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 03:57:22,943 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 03:57:22,946 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 03:57:23,790 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 03:57:23,792 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 03:57:23,793 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 03:57:23,794 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 03:57:23,796 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 03:57:23,797 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 03:57:23,798 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 03:57:23,799 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 03:57:23,801 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 03:57:23,802 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 03:57:23,803 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 03:57:23,804 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 03:57:23,806 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 03:57:23,807 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 03:57:23,808 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 03:57:23,810 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 03:57:23,811 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 03:57:23,812 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 03:57:23,814 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 03:57:23,825 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 03:57:23,826 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 03:57:23,827 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 03:57:23,829 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 03:57:23,830 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 03:57:23,831 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 03:57:23,832 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 03:57:23,834 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 03:57:23,835 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 03:57:23,836 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 03:57:23,837 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 03:57:23,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 03:57:23,840 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 03:57:23,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 03:57:23,842 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 03:57:23,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 03:57:23,844 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 03:57:24,439 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 03:57:24,439 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 03:57:24,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,440 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-29 03:57:24,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:24,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:24,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-11-29 03:57:24,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,462 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-29 03:57:24,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:24,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:24,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-11-29 03:57:24,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,483 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-29 03:57:24,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:24,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:24,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-11-29 03:57:24,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,504 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-29 03:57:24,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:24,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:24,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-11-29 03:57:24,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,528 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-29 03:57:24,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:24,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:24,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-11-29 03:57:24,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,556 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-29 03:57:24,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:24,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:24,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-11-29 03:57:24,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,576 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-29 03:57:24,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:24,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:24,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-11-29 03:57:24,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,605 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-29 03:57:24,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:24,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:24,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:24,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,626 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-29 03:57:24,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:24,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:24,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-11-29 03:57:24,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,649 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-11-29 03:57:24,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:24,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:24,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:24,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,681 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-11-29 03:57:24,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:24,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:24,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-11-29 03:57:24,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,704 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-11-29 03:57:24,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:24,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:24,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:24,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:24,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:24,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:24,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:24,729 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 03:57:24,745 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-11-29 03:57:24,745 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-11-29 03:57:24,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:24,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:24,746 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:24,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-11-29 03:57:24,748 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 03:57:24,759 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 03:57:24,759 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 03:57:24,759 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 func_to_recursive_line_23_to_24_0_#in~b.base) 0)_1) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_23_to_24_0_#in~b.base) 0)_1 + 11 Supporting invariants [] [2023-11-29 03:57:24,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-11-29 03:57:24,827 INFO L156 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2023-11-29 03:57:24,829 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[#in~b!base][0] could not be translated [2023-11-29 03:57:24,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:24,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:57:24,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:25,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 2942 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 03:57:25,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:26,622 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 03:57:26,652 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 03:57:26,653 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 5 loop predicates [2023-11-29 03:57:26,653 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 125 transitions. cyclomatic complexity: 20 Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 03:57:26,930 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 125 transitions. cyclomatic complexity: 20. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 376 states and 425 transitions. Complement of second has 25 states. [2023-11-29 03:57:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 5 non-accepting loop states 1 accepting loop states [2023-11-29 03:57:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 03:57:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2023-11-29 03:57:26,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 6 letters. Loop has 255 letters. [2023-11-29 03:57:26,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:26,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 261 letters. Loop has 255 letters. [2023-11-29 03:57:26,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:26,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 6 letters. Loop has 510 letters. [2023-11-29 03:57:26,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:26,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 376 states and 425 transitions. [2023-11-29 03:57:26,939 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2023-11-29 03:57:26,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 376 states to 256 states and 296 transitions. [2023-11-29 03:57:26,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2023-11-29 03:57:26,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2023-11-29 03:57:26,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 296 transitions. [2023-11-29 03:57:26,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 03:57:26,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 256 states and 296 transitions. [2023-11-29 03:57:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 296 transitions. [2023-11-29 03:57:26,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 241. [2023-11-29 03:57:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 132 states have (on average 1.1136363636363635) internal successors, (147), 145 states have internal predecessors, (147), 38 states have call successors, (38), 21 states have call predecessors, (38), 71 states have return successors, (92), 74 states have call predecessors, (92), 30 states have call successors, (92) [2023-11-29 03:57:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 277 transitions. [2023-11-29 03:57:26,960 INFO L240 hiAutomatonCegarLoop]: Abstraction has 241 states and 277 transitions. [2023-11-29 03:57:26,960 INFO L428 stractBuchiCegarLoop]: Abstraction has 241 states and 277 transitions. [2023-11-29 03:57:26,961 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-29 03:57:26,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 277 transitions. [2023-11-29 03:57:26,963 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2023-11-29 03:57:26,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:57:26,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:57:26,963 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:57:26,963 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:57:26,963 INFO L748 eck$LassoCheckResult]: Stem: 53899#$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); 53856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 53850#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 53889#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 53890#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 53835#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 53871#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 53873#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 53837#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 53857#$Ultimate##0 [2023-11-29 03:57:26,964 INFO L750 eck$LassoCheckResult]: Loop: 53857#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 53836#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 53838#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 53860#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 53895#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 53859#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 53860#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 53895#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 53859#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 53860#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 53895#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 53859#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 53860#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 53895#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 53859#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 53860#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 53895#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 53859#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 53860#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 53895#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 53859#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 53860#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 53895#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 53865#L25-1 assume true; 53866#func_to_recursive_line_25_to_25_0EXIT >#92#return; 53885#L25-1 assume true; 53995#func_to_recursive_line_25_to_25_0EXIT >#92#return; 53994#L25-1 assume true; 53993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 53992#L25-1 assume true; 53991#func_to_recursive_line_25_to_25_0EXIT >#92#return; 53990#L25-1 assume true; 53989#func_to_recursive_line_25_to_25_0EXIT >#92#return; 53988#L25-1 assume true; 53987#func_to_recursive_line_25_to_25_0EXIT >#92#return; 53986#L25-1 assume true; 53985#func_to_recursive_line_25_to_25_0EXIT >#80#return; 53887#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 53839#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 53857#$Ultimate##0 [2023-11-29 03:57:26,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:26,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2131917546, now seen corresponding path program 1 times [2023-11-29 03:57:26,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:26,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832508883] [2023-11-29 03:57:26,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:26,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:26,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:26,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:26,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1152986410, now seen corresponding path program 1 times [2023-11-29 03:57:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300404284] [2023-11-29 03:57:26,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:27,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:27,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:27,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:27,027 INFO L85 PathProgramCache]: Analyzing trace with hash -313364447, now seen corresponding path program 1 times [2023-11-29 03:57:27,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:27,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661395116] [2023-11-29 03:57:27,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:27,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:27,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:27,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:31,924 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 03:57:31,924 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 03:57:31,924 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 03:57:31,924 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 03:57:31,924 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 03:57:31,924 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:31,924 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 03:57:31,924 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 03:57:31,924 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_4.c_Iteration14_Lasso [2023-11-29 03:57:31,924 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 03:57:31,924 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 03:57:31,927 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 03:57:31,929 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 03:57:31,931 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 03:57:31,933 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 03:57:31,935 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 03:57:31,936 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 03:57:31,938 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 03:57:31,940 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 03:57:31,941 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 03:57:31,943 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 03:57:31,944 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 03:57:31,945 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 03:57:31,946 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 03:57:31,948 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 03:57:31,949 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 03:57:31,950 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 03:57:31,951 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 03:57:31,952 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 03:57:31,953 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 03:57:31,955 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 03:57:31,956 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 03:57:31,957 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 03:57:31,958 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 03:57:31,959 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 03:57:31,961 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 03:57:31,962 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 03:57:31,963 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 03:57:31,964 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 03:57:32,512 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 03:57:32,514 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 03:57:32,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 03:57:32,516 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 03:57:32,517 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 03:57:32,518 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 03:57:32,520 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 03:57:32,521 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 03:57:32,522 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 03:57:32,534 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 03:57:32,535 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 03:57:32,537 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 03:57:32,538 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 03:57:32,539 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 03:57:32,541 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 03:57:32,542 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 03:57:32,543 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 03:57:32,544 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 03:57:32,546 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 03:57:33,044 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 03:57:33,044 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 03:57:33,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,045 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-11-29 03:57:33,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 03:57:33,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,063 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-11-29 03:57:33,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-11-29 03:57:33,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,082 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-11-29 03:57:33,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 03:57:33,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,100 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-11-29 03:57:33,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:33,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,117 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-29 03:57:33,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-11-29 03:57:33,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,135 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-29 03:57:33,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:33,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,151 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-29 03:57:33,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:33,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-11-29 03:57:33,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,169 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-29 03:57:33,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-11-29 03:57:33,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,187 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-11-29 03:57:33,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,204 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-11-29 03:57:33,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-11-29 03:57:33,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,221 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-11-29 03:57:33,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-11-29 03:57:33,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,238 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-11-29 03:57:33,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,255 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-11-29 03:57:33,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 03:57:33,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2023-11-29 03:57:33,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,272 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-11-29 03:57:33,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-11-29 03:57:33,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,290 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-11-29 03:57:33,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2023-11-29 03:57:33,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,307 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-11-29 03:57:33,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:33,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2023-11-29 03:57:33,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,325 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-11-29 03:57:33,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2023-11-29 03:57:33,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,342 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-11-29 03:57:33,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 03:57:33,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,359 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-11-29 03:57:33,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2023-11-29 03:57:33,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,376 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-11-29 03:57:33,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:33,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2023-11-29 03:57:33,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,393 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-11-29 03:57:33,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2023-11-29 03:57:33,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,410 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-11-29 03:57:33,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2023-11-29 03:57:33,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,428 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-11-29 03:57:33,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,445 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-11-29 03:57:33,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2023-11-29 03:57:33,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,462 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-11-29 03:57:33,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:33,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:33,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:33,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2023-11-29 03:57:33,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,479 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-11-29 03:57:33,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:33,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:33,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,500 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-11-29 03:57:33,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-11-29 03:57:33,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:33,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:33,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,620 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-11-29 03:57:33,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:33,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:33,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,641 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-11-29 03:57:33,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:33,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:33,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:33,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2023-11-29 03:57:33,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,663 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-11-29 03:57:33,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:33,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:33,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:33,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:33,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:33,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:33,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:33,693 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 03:57:33,705 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-11-29 03:57:33,705 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-11-29 03:57:33,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:33,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:33,706 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:33,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-11-29 03:57:33,708 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 03:57:33,718 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 03:57:33,718 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 03:57:33,718 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#4 func_to_recursive_line_24_to_25_0_#in~c.base) 0)_1) = -2*v_rep(select (select #memory_int#4 func_to_recursive_line_24_to_25_0_#in~c.base) 0)_1 + 11 Supporting invariants [] [2023-11-29 03:57:33,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:33,759 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2023-11-29 03:57:33,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[#in~c!base][0] could not be translated [2023-11-29 03:57:33,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:33,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 03:57:33,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:33,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 03:57:33,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:34,295 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 03:57:34,331 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 03:57:34,331 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2023-11-29 03:57:34,331 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 241 states and 277 transitions. cyclomatic complexity: 51 Second operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 6 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:57:34,668 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 241 states and 277 transitions. cyclomatic complexity: 51. Second operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 6 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 511 states and 586 transitions. Complement of second has 27 states. [2023-11-29 03:57:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 5 non-accepting loop states 1 accepting loop states [2023-11-29 03:57:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 6 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:57:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2023-11-29 03:57:34,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 23 transitions. Stem has 9 letters. Loop has 39 letters. [2023-11-29 03:57:34,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:34,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 23 transitions. Stem has 48 letters. Loop has 39 letters. [2023-11-29 03:57:34,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:34,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 23 transitions. Stem has 9 letters. Loop has 78 letters. [2023-11-29 03:57:34,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:34,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 586 transitions. [2023-11-29 03:57:34,679 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2023-11-29 03:57:34,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 357 states and 422 transitions. [2023-11-29 03:57:34,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2023-11-29 03:57:34,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2023-11-29 03:57:34,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 357 states and 422 transitions. [2023-11-29 03:57:34,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 03:57:34,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 357 states and 422 transitions. [2023-11-29 03:57:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states and 422 transitions. [2023-11-29 03:57:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2023-11-29 03:57:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 190 states have (on average 1.1157894736842104) internal successors, (212), 210 states have internal predecessors, (212), 58 states have call successors, (58), 34 states have call predecessors, (58), 94 states have return successors, (133), 97 states have call predecessors, (133), 46 states have call successors, (133) [2023-11-29 03:57:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 403 transitions. [2023-11-29 03:57:34,703 INFO L240 hiAutomatonCegarLoop]: Abstraction has 342 states and 403 transitions. [2023-11-29 03:57:34,703 INFO L428 stractBuchiCegarLoop]: Abstraction has 342 states and 403 transitions. [2023-11-29 03:57:34,703 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-29 03:57:34,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 403 transitions. [2023-11-29 03:57:34,705 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2023-11-29 03:57:34,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:57:34,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:57:34,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:57:34,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 03:57:34,706 INFO L748 eck$LassoCheckResult]: Stem: 54911#$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); 54866#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 54860#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 54906#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 54907#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 54884#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 54883#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 54886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 54852#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 54899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 54849#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 54851#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 54872#$Ultimate##0 [2023-11-29 03:57:34,706 INFO L750 eck$LassoCheckResult]: Loop: 54872#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 54914#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 54871#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 54872#$Ultimate##0 [2023-11-29 03:57:34,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:34,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2020760534, now seen corresponding path program 1 times [2023-11-29 03:57:34,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:34,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012704027] [2023-11-29 03:57:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:34,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:34,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:34,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:34,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:34,750 INFO L85 PathProgramCache]: Analyzing trace with hash 62711, now seen corresponding path program 1 times [2023-11-29 03:57:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582231342] [2023-11-29 03:57:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:34,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:34,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:34,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2079486718, now seen corresponding path program 1 times [2023-11-29 03:57:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014975694] [2023-11-29 03:57:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:34,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:34,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:39,253 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 03:57:39,253 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 03:57:39,254 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 03:57:39,254 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 03:57:39,254 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 03:57:39,254 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:39,254 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 03:57:39,254 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 03:57:39,254 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_4.c_Iteration15_Lasso [2023-11-29 03:57:39,254 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 03:57:39,254 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 03:57:39,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 03:57:39,257 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 03:57:39,259 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 03:57:39,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 03:57:39,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 03:57:39,262 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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,292 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 03:57:39,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 03:57:39,295 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 03:57:39,296 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 03:57:39,297 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 03:57:39,299 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 03:57:39,300 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 03:57:39,302 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 03:57:39,303 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 03:57:39,304 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 03:57:39,305 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 03:57:39,306 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 03:57:39,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 03:57:39,709 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 03:57:39,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 03:57:39,712 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 03:57:39,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 03:57:39,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 03:57:39,716 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 03:57:39,718 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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,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 03:57:39,724 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 03:57:39,726 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 03:57:39,727 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 03:57:39,728 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 03:57:39,730 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 03:57:39,731 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 03:57:39,732 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 03:57:39,734 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 03:57:39,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 03:57:39,736 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 03:57:39,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 03:57:40,121 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 03:57:40,121 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 03:57:40,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,123 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-11-29 03:57:40,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,141 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-11-29 03:57:40,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2023-11-29 03:57:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,161 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-11-29 03:57:40,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,179 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-11-29 03:57:40,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,196 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2023-11-29 03:57:40,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,213 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2023-11-29 03:57:40,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:40,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2023-11-29 03:57:40,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,231 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2023-11-29 03:57:40,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2023-11-29 03:57:40,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,248 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2023-11-29 03:57:40,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:40,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:40,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,269 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2023-11-29 03:57:40,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:40,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:40,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,289 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2023-11-29 03:57:40,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,310 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2023-11-29 03:57:40,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,327 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2023-11-29 03:57:40,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2023-11-29 03:57:40,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,344 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2023-11-29 03:57:40,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2023-11-29 03:57:40,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,361 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2023-11-29 03:57:40,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:40,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,379 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2023-11-29 03:57:40,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,396 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2023-11-29 03:57:40,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:40,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,412 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2023-11-29 03:57:40,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,429 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2023-11-29 03:57:40,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 03:57:40,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2023-11-29 03:57:40,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,447 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2023-11-29 03:57:40,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2023-11-29 03:57:40,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,463 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2023-11-29 03:57:40,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:40,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2023-11-29 03:57:40,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,480 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2023-11-29 03:57:40,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:40,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,497 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2023-11-29 03:57:40,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:40,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2023-11-29 03:57:40,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,514 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2023-11-29 03:57:40,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,531 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2023-11-29 03:57:40,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:40,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,547 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2023-11-29 03:57:40,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,565 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2023-11-29 03:57:40,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,581 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2023-11-29 03:57:40,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,599 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2023-11-29 03:57:40,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2023-11-29 03:57:40,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,615 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2023-11-29 03:57:40,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:40,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,632 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2023-11-29 03:57:40,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2023-11-29 03:57:40,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,649 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2023-11-29 03:57:40,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:40,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:40,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:40,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2023-11-29 03:57:40,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,666 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2023-11-29 03:57:40,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:40,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:40,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:40,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2023-11-29 03:57:40,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,688 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2023-11-29 03:57:40,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:40,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:40,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2023-11-29 03:57:40,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,710 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2023-11-29 03:57:40,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:40,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:40,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2023-11-29 03:57:40,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,729 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2023-11-29 03:57:40,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:40,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:40,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:40,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,749 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2023-11-29 03:57:40,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:40,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:40,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:40,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2023-11-29 03:57:40,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,771 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2023-11-29 03:57:40,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:40,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:40,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2023-11-29 03:57:40,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,791 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2023-11-29 03:57:40,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:40,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:40,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2023-11-29 03:57:40,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,810 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2023-11-29 03:57:40,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:40,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:40,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:40,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2023-11-29 03:57:40,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,832 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2023-11-29 03:57:40,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:40,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:40,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:40,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:40,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:40,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:40,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:40,859 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 03:57:40,878 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-11-29 03:57:40,878 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-29 03:57:40,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:40,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:40,879 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:40,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2023-11-29 03:57:40,881 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 03:57:40,891 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 03:57:40,891 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 03:57:40,892 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 func_to_recursive_line_25_to_25_0_#in~d.base) func_to_recursive_line_25_to_25_0_#in~d.offset)_1) = -2*v_rep(select (select #memory_int#2 func_to_recursive_line_25_to_25_0_#in~d.base) func_to_recursive_line_25_to_25_0_#in~d.offset)_1 + 11 Supporting invariants [] [2023-11-29 03:57:40,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2023-11-29 03:57:40,912 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2023-11-29 03:57:40,914 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[#in~d!base][#in~d!offset] could not be translated [2023-11-29 03:57:40,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:40,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:57:40,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:41,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 03:57:41,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:41,027 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 03:57:41,047 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 03:57:41,047 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-29 03:57:41,048 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 342 states and 403 transitions. cyclomatic complexity: 83 Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:57:41,119 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 342 states and 403 transitions. cyclomatic complexity: 83. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 398 states and 481 transitions. Complement of second has 15 states. [2023-11-29 03:57:41,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-29 03:57:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:57:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2023-11-29 03:57:41,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 3 letters. [2023-11-29 03:57:41,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:41,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 15 letters. Loop has 3 letters. [2023-11-29 03:57:41,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:41,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 6 letters. [2023-11-29 03:57:41,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:41,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 481 transitions. [2023-11-29 03:57:41,127 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2023-11-29 03:57:41,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 371 states and 453 transitions. [2023-11-29 03:57:41,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2023-11-29 03:57:41,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2023-11-29 03:57:41,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 453 transitions. [2023-11-29 03:57:41,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 03:57:41,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 371 states and 453 transitions. [2023-11-29 03:57:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 453 transitions. [2023-11-29 03:57:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2023-11-29 03:57:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 209 states have (on average 1.1148325358851674) internal successors, (233), 233 states have internal predecessors, (233), 65 states have call successors, (65), 40 states have call predecessors, (65), 97 states have return successors, (155), 97 states have call predecessors, (155), 53 states have call successors, (155) [2023-11-29 03:57:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 453 transitions. [2023-11-29 03:57:41,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 371 states and 453 transitions. [2023-11-29 03:57:41,150 INFO L428 stractBuchiCegarLoop]: Abstraction has 371 states and 453 transitions. [2023-11-29 03:57:41,150 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-11-29 03:57:41,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 453 transitions. [2023-11-29 03:57:41,153 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2023-11-29 03:57:41,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:57:41,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:57:41,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:57:41,153 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 03:57:41,153 INFO L748 eck$LassoCheckResult]: Stem: 55768#$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); 55712#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 55705#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 55755#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 55708#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 55709#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 55733#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 55735#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 55744#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 55745#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 55753#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 55832#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 55945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 55943#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 55849#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 55853#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 55928#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 55848#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 55853#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 55928#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 55848#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 55853#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 55928#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 55848#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 55853#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 55928#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 55848#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 55853#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 55928#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 55848#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 55853#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 55926#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 55922#L25-1 assume true; 55923#func_to_recursive_line_25_to_25_0EXIT >#92#return; 55869#L25-1 assume true; 55867#func_to_recursive_line_25_to_25_0EXIT >#92#return; 55866#L25-1 assume true; 55864#func_to_recursive_line_25_to_25_0EXIT >#92#return; 55862#L25-1 assume true; 55861#func_to_recursive_line_25_to_25_0EXIT >#92#return; 55859#L25-1 assume true; 55856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 55852#L25-1 assume true; 55847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 55844#L25-1 assume true; 55831#func_to_recursive_line_25_to_25_0EXIT >#80#return; 55830#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 55694#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 55828#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 55693#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 55695#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 55720#$Ultimate##0 [2023-11-29 03:57:41,154 INFO L750 eck$LassoCheckResult]: Loop: 55720#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 55760#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 55719#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 55720#$Ultimate##0 [2023-11-29 03:57:41,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:41,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1818661099, now seen corresponding path program 2 times [2023-11-29 03:57:41,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:41,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973158581] [2023-11-29 03:57:41,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:41,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:41,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:41,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:41,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash 62711, now seen corresponding path program 2 times [2023-11-29 03:57:41,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:41,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318506417] [2023-11-29 03:57:41,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:41,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:41,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:41,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:41,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1279605811, now seen corresponding path program 3 times [2023-11-29 03:57:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:41,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576735088] [2023-11-29 03:57:41,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:41,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:41,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:46,829 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 03:57:46,829 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 03:57:46,829 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 03:57:46,829 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 03:57:46,829 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 03:57:46,829 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:46,829 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 03:57:46,829 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 03:57:46,829 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_4.c_Iteration16_Lasso [2023-11-29 03:57:46,829 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 03:57:46,829 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 03:57:46,831 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 03:57:46,833 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 03:57:46,835 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 03:57:46,836 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 03:57:46,837 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 03:57:46,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 03:57:46,840 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 03:57:46,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 03:57:46,842 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 03:57:46,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 03:57:47,193 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 03:57:47,195 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 03:57:47,196 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 03:57:47,197 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 03:57:47,199 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 03:57:47,200 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 03:57:47,201 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 03:57:47,203 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 03:57:47,204 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 03:57:47,206 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 03:57:47,207 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 03:57:47,208 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 03:57:47,209 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 03:57:47,211 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 03:57:47,212 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 03:57:47,213 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 03:57:47,215 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 03:57:47,225 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 03:57:47,227 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 03:57:47,228 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 03:57:47,230 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 03:57:47,231 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 03:57:47,233 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 03:57:47,234 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 03:57:47,235 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 03:57:47,237 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 03:57:47,238 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 03:57:47,240 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 03:57:47,241 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 03:57:47,242 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 03:57:47,244 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 03:57:47,245 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 03:57:47,246 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 03:57:47,247 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 03:57:47,249 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 03:57:47,250 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 03:57:47,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 03:57:47,252 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 03:57:47,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 03:57:47,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 03:57:47,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 03:57:47,257 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 03:57:47,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 03:57:47,259 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 03:57:47,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 03:57:47,262 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 03:57:47,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 03:57:47,612 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 03:57:47,613 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 03:57:47,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,614 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2023-11-29 03:57:47,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:47,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:47,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:47,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:47,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2023-11-29 03:57:47,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,630 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2023-11-29 03:57:47,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:47,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:47,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:47,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:47,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2023-11-29 03:57:47,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,648 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2023-11-29 03:57:47,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:47,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:47,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:47,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:47,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2023-11-29 03:57:47,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,665 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2023-11-29 03:57:47,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:47,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:47,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:47,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:47,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:47,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,681 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2023-11-29 03:57:47,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:47,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:47,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:47,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:47,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2023-11-29 03:57:47,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,698 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2023-11-29 03:57:47,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:47,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:47,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:47,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:47,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2023-11-29 03:57:47,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,716 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2023-11-29 03:57:47,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:47,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:47,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:47,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:47,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2023-11-29 03:57:47,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,732 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2023-11-29 03:57:47,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:47,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:47,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:47,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:47,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:47,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,749 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2023-11-29 03:57:47,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:47,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:57:47,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:57:47,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:57:47,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:47,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,766 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2023-11-29 03:57:47,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:47,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:47,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:47,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:47,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,787 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2023-11-29 03:57:47,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:47,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:47,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:47,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:47,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,807 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2023-11-29 03:57:47,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:47,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:47,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:47,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2023-11-29 03:57:47,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,829 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2023-11-29 03:57:47,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:47,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:47,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:47,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2023-11-29 03:57:47,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,849 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2023-11-29 03:57:47,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:47,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:47,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:47,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:47,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:47,871 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:47,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2023-11-29 03:57:47,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:47,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2023-11-29 03:57:47,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2023-11-29 03:57:47,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:47,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:47,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:47,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:47,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:47,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:47,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:47,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2023-11-29 03:57:47,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:48,000 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:48,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2023-11-29 03:57:48,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:48,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:48,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:48,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:48,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:48,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:48,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:48,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:48,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:48,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:48,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:48,021 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:48,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2023-11-29 03:57:48,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:57:48,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:48,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:48,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:48,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:48,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:48,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:48,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:57:48,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2023-11-29 03:57:48,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:48,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:48,041 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:48,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2023-11-29 03:57:48,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:57:48,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:57:48,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:57:48,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:57:48,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:57:48,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:57:48,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:57:48,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 03:57:48,086 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-11-29 03:57:48,086 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2023-11-29 03:57:48,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:57:48,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:57:48,087 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:57:48,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2023-11-29 03:57:48,089 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 03:57:48,100 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 03:57:48,100 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 03:57:48,100 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 func_to_recursive_line_25_to_25_0_#in~d.base) 0)_2) = -2*v_rep(select (select #memory_int#2 func_to_recursive_line_25_to_25_0_#in~d.base) 0)_2 + 11 Supporting invariants [] [2023-11-29 03:57:48,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2023-11-29 03:57:48,125 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2023-11-29 03:57:48,127 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[#in~d!base][0] could not be translated [2023-11-29 03:57:48,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:48,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 03:57:48,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:48,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 03:57:48,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:48,862 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 03:57:48,899 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 03:57:48,900 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 3 loop predicates [2023-11-29 03:57:48,900 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 371 states and 453 transitions. cyclomatic complexity: 107 Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 6 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:57:49,346 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 371 states and 453 transitions. cyclomatic complexity: 107. Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 6 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 392 states and 474 transitions. Complement of second has 21 states. [2023-11-29 03:57:49,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-29 03:57:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 6 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:57:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2023-11-29 03:57:49,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. Stem has 51 letters. Loop has 3 letters. [2023-11-29 03:57:49,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:49,348 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 03:57:49,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:49,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 03:57:49,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:50,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 03:57:50,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:50,095 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 03:57:50,129 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 03:57:50,129 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 3 loop predicates [2023-11-29 03:57:50,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 371 states and 453 transitions. cyclomatic complexity: 107 Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 6 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:57:50,552 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 371 states and 453 transitions. cyclomatic complexity: 107. Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 6 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 392 states and 474 transitions. Complement of second has 21 states. [2023-11-29 03:57:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-29 03:57:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 6 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:57:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2023-11-29 03:57:50,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. Stem has 51 letters. Loop has 3 letters. [2023-11-29 03:57:50,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:50,553 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 03:57:50,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:50,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 03:57:50,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:57:51,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 03:57:51,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:57:51,217 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 03:57:51,249 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 03:57:51,249 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 3 loop predicates [2023-11-29 03:57:51,249 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 371 states and 453 transitions. cyclomatic complexity: 107 Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 6 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:57:51,790 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 371 states and 453 transitions. cyclomatic complexity: 107. Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 6 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 596 states and 689 transitions. Complement of second has 30 states. [2023-11-29 03:57:51,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-29 03:57:51,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 6 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:57:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 39 transitions. [2023-11-29 03:57:51,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 39 transitions. Stem has 51 letters. Loop has 3 letters. [2023-11-29 03:57:51,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:51,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 39 transitions. Stem has 54 letters. Loop has 3 letters. [2023-11-29 03:57:51,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:51,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 39 transitions. Stem has 51 letters. Loop has 6 letters. [2023-11-29 03:57:51,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:57:51,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 596 states and 689 transitions. [2023-11-29 03:57:51,802 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2023-11-29 03:57:51,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 596 states to 387 states and 468 transitions. [2023-11-29 03:57:51,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2023-11-29 03:57:51,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2023-11-29 03:57:51,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 468 transitions. [2023-11-29 03:57:51,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 03:57:51,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 387 states and 468 transitions. [2023-11-29 03:57:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 468 transitions. [2023-11-29 03:57:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 341. [2023-11-29 03:57:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 194 states have (on average 1.092783505154639) internal successors, (212), 212 states have internal predecessors, (212), 60 states have call successors, (60), 36 states have call predecessors, (60), 87 states have return successors, (127), 92 states have call predecessors, (127), 52 states have call successors, (127) [2023-11-29 03:57:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 399 transitions. [2023-11-29 03:57:51,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 341 states and 399 transitions. [2023-11-29 03:57:51,824 INFO L428 stractBuchiCegarLoop]: Abstraction has 341 states and 399 transitions. [2023-11-29 03:57:51,825 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-11-29 03:57:51,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 341 states and 399 transitions. [2023-11-29 03:57:51,827 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2023-11-29 03:57:51,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:57:51,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:57:51,829 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, 1, 1, 1] [2023-11-29 03:57:51,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:57:51,829 INFO L748 eck$LassoCheckResult]: Stem: 58195#$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); 58150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 58144#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 58187#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 58146#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 58147#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 58165#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 58166#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 58280#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 58328#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 58327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 58318#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58353#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58323#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58347#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58346#L25-1 assume true; 58337#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58336#L25-1 assume true; 58335#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58334#L25-1 assume true; 58333#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58332#L25-1 assume true; 58331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58330#L25-1 assume true; 58329#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58325#L25-1 assume true; 58322#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58321#L25-1 assume true; 58317#func_to_recursive_line_25_to_25_0EXIT >#80#return; 58319#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 58288#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 58290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 58314#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 58315#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58353#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58323#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58347#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58346#L25-1 assume true; 58337#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58336#L25-1 assume true; 58335#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58334#L25-1 assume true; 58333#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58332#L25-1 assume true; 58331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58330#L25-1 assume true; 58329#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58325#L25-1 assume true; 58322#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58321#L25-1 assume true; 58317#func_to_recursive_line_25_to_25_0EXIT >#80#return; 58316#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 58287#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 58290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 58314#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 58315#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58353#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58323#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58347#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58346#L25-1 assume true; 58337#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58336#L25-1 assume true; 58335#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58334#L25-1 assume true; 58333#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58332#L25-1 assume true; 58331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58330#L25-1 assume true; 58329#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58325#L25-1 assume true; 58322#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58321#L25-1 assume true; 58317#func_to_recursive_line_25_to_25_0EXIT >#80#return; 58316#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 58287#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 58290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 58314#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 58315#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58353#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58323#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58347#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58346#L25-1 assume true; 58337#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58336#L25-1 assume true; 58335#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58334#L25-1 assume true; 58333#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58332#L25-1 assume true; 58331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58330#L25-1 assume true; 58329#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58325#L25-1 assume true; 58322#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58321#L25-1 assume true; 58317#func_to_recursive_line_25_to_25_0EXIT >#80#return; 58316#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 58287#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 58290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 58314#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 58315#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58353#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58323#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58347#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58346#L25-1 assume true; 58337#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58336#L25-1 assume true; 58335#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58334#L25-1 assume true; 58333#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58332#L25-1 assume true; 58331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58330#L25-1 assume true; 58329#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58325#L25-1 assume true; 58322#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58321#L25-1 assume true; 58317#func_to_recursive_line_25_to_25_0EXIT >#80#return; 58316#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 58287#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 58290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 58314#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 58315#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58320#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58353#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58323#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58348#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58324#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58347#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58346#L25-1 assume true; 58337#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58336#L25-1 assume true; 58335#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58334#L25-1 assume true; 58333#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58332#L25-1 assume true; 58331#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58330#L25-1 assume true; 58329#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58325#L25-1 assume true; 58322#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58321#L25-1 assume true; 58317#func_to_recursive_line_25_to_25_0EXIT >#80#return; 58316#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 58287#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 58290#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 58305#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58302#L41-1 assume true; 58303#func_to_recursive_line_24_to_25_0EXIT >#82#return; 58298#L41-1 assume true; 58297#func_to_recursive_line_24_to_25_0EXIT >#82#return; 58296#L41-1 assume true; 58295#func_to_recursive_line_24_to_25_0EXIT >#82#return; 58294#L41-1 assume true; 58293#func_to_recursive_line_24_to_25_0EXIT >#82#return; 58292#L41-1 assume true; 58291#func_to_recursive_line_24_to_25_0EXIT >#82#return; 58289#L41-1 assume true; 58284#func_to_recursive_line_24_to_25_0EXIT >#82#return; 58283#L41-1 assume true; 58278#func_to_recursive_line_24_to_25_0EXIT >#84#return; 58271#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 58177#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 58254#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 58180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 58133#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 58151#$Ultimate##0 [2023-11-29 03:57:51,829 INFO L750 eck$LassoCheckResult]: Loop: 58151#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 58130#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 58132#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58204#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58207#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58160#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58235#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58235#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58235#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58235#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58235#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 58161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 58235#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 58196#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58197#L25-1 assume true; 58183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58159#L25-1 assume true; 58162#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58277#L25-1 assume true; 58276#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58275#L25-1 assume true; 58274#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58273#L25-1 assume true; 58272#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58270#L25-1 assume true; 58269#func_to_recursive_line_25_to_25_0EXIT >#92#return; 58268#L25-1 assume true; 58267#func_to_recursive_line_25_to_25_0EXIT >#80#return; 58185#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 58131#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 58151#$Ultimate##0 [2023-11-29 03:57:51,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash -981087949, now seen corresponding path program 2 times [2023-11-29 03:57:51,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:51,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263441859] [2023-11-29 03:57:51,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:51,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:51,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:52,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:52,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:52,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1152986410, now seen corresponding path program 2 times [2023-11-29 03:57:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008322259] [2023-11-29 03:57:52,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:52,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:52,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:52,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:57:52,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:57:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1701220, now seen corresponding path program 3 times [2023-11-29 03:57:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:57:52,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75404149] [2023-11-29 03:57:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:57:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:57:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:52,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:57:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:57:52,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:58:04,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2023-11-29 03:58:13,569 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 03:58:13,569 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 03:58:13,569 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 03:58:13,569 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 03:58:13,569 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 03:58:13,569 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:13,569 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 03:58:13,569 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 03:58:13,569 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_4.c_Iteration17_Lasso [2023-11-29 03:58:13,569 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 03:58:13,569 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 03:58:13,572 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 03:58:13,574 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 03:58:13,575 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 03:58:13,576 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 03:58:13,578 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 03:58:13,579 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 03:58:13,580 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 03:58:13,582 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 03:58:13,583 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 03:58:13,584 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 03:58:13,585 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 03:58:13,587 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 03:58:13,588 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 03:58:13,589 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 03:58:13,590 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 03:58:13,592 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 03:58:13,593 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 03:58:13,594 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 03:58:13,595 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 03:58:13,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 03:58:13,598 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 03:58:13,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 03:58:13,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 03:58:13,601 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 03:58:13,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 03:58:13,604 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 03:58:13,605 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 03:58:13,606 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 03:58:13,607 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 03:58:13,609 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 03:58:13,610 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 03:58:13,611 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 03:58:13,612 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 03:58:13,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 03:58:13,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 03:58:13,616 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 03:58:13,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 03:58:13,619 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 03:58:13,620 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 03:58:13,621 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 03:58:13,623 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 03:58:13,624 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 03:58:13,626 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 03:58:13,641 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 03:58:13,642 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 03:58:13,643 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 03:58:13,644 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 03:58:14,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 03:58:14,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 03:58:14,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 03:58:14,264 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 03:58:14,771 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 03:58:14,771 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 03:58:14,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,772 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2023-11-29 03:58:14,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2023-11-29 03:58:14,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,789 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2023-11-29 03:58:14,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2023-11-29 03:58:14,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,806 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2023-11-29 03:58:14,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2023-11-29 03:58:14,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,823 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2023-11-29 03:58:14,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2023-11-29 03:58:14,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,840 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2023-11-29 03:58:14,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2023-11-29 03:58:14,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,861 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2023-11-29 03:58:14,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2023-11-29 03:58:14,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,879 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2023-11-29 03:58:14,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2023-11-29 03:58:14,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,896 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2023-11-29 03:58:14,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2023-11-29 03:58:14,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,913 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2023-11-29 03:58:14,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2023-11-29 03:58:14,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,930 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2023-11-29 03:58:14,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2023-11-29 03:58:14,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,948 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2023-11-29 03:58:14,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:58:14,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2023-11-29 03:58:14,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,965 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2023-11-29 03:58:14,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:14,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2023-11-29 03:58:14,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:14,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:14,983 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:14,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2023-11-29 03:58:14,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:14,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:14,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:14,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:14,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:14,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:14,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:14,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:14,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2023-11-29 03:58:15,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,001 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2023-11-29 03:58:15,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 03:58:15,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2023-11-29 03:58:15,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,019 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2023-11-29 03:58:15,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2023-11-29 03:58:15,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,036 INFO L229 MonitoredProcess]: Starting monitored process 145 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2023-11-29 03:58:15,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2023-11-29 03:58:15,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,053 INFO L229 MonitoredProcess]: Starting monitored process 146 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2023-11-29 03:58:15,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2023-11-29 03:58:15,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,070 INFO L229 MonitoredProcess]: Starting monitored process 147 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2023-11-29 03:58:15,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2023-11-29 03:58:15,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,086 INFO L229 MonitoredProcess]: Starting monitored process 148 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2023-11-29 03:58:15,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2023-11-29 03:58:15,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,103 INFO L229 MonitoredProcess]: Starting monitored process 149 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2023-11-29 03:58:15,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2023-11-29 03:58:15,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,121 INFO L229 MonitoredProcess]: Starting monitored process 150 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2023-11-29 03:58:15,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:58:15,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2023-11-29 03:58:15,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,138 INFO L229 MonitoredProcess]: Starting monitored process 151 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2023-11-29 03:58:15,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:58:15,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2023-11-29 03:58:15,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,156 INFO L229 MonitoredProcess]: Starting monitored process 152 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2023-11-29 03:58:15,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2023-11-29 03:58:15,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,173 INFO L229 MonitoredProcess]: Starting monitored process 153 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2023-11-29 03:58:15,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2023-11-29 03:58:15,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,190 INFO L229 MonitoredProcess]: Starting monitored process 154 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2023-11-29 03:58:15,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:58:15,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2023-11-29 03:58:15,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,208 INFO L229 MonitoredProcess]: Starting monitored process 155 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2023-11-29 03:58:15,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:58:15,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2023-11-29 03:58:15,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,225 INFO L229 MonitoredProcess]: Starting monitored process 156 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2023-11-29 03:58:15,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 03:58:15,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2023-11-29 03:58:15,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,242 INFO L229 MonitoredProcess]: Starting monitored process 157 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2023-11-29 03:58:15,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2023-11-29 03:58:15,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,259 INFO L229 MonitoredProcess]: Starting monitored process 158 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2023-11-29 03:58:15,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2023-11-29 03:58:15,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,276 INFO L229 MonitoredProcess]: Starting monitored process 159 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2023-11-29 03:58:15,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 03:58:15,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2023-11-29 03:58:15,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,293 INFO L229 MonitoredProcess]: Starting monitored process 160 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2023-11-29 03:58:15,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2023-11-29 03:58:15,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,311 INFO L229 MonitoredProcess]: Starting monitored process 161 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2023-11-29 03:58:15,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2023-11-29 03:58:15,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,328 INFO L229 MonitoredProcess]: Starting monitored process 162 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2023-11-29 03:58:15,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2023-11-29 03:58:15,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,346 INFO L229 MonitoredProcess]: Starting monitored process 163 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2023-11-29 03:58:15,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 03:58:15,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2023-11-29 03:58:15,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,363 INFO L229 MonitoredProcess]: Starting monitored process 164 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2023-11-29 03:58:15,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2023-11-29 03:58:15,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,381 INFO L229 MonitoredProcess]: Starting monitored process 165 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2023-11-29 03:58:15,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:58:15,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2023-11-29 03:58:15,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,398 INFO L229 MonitoredProcess]: Starting monitored process 166 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2023-11-29 03:58:15,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2023-11-29 03:58:15,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,415 INFO L229 MonitoredProcess]: Starting monitored process 167 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2023-11-29 03:58:15,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2023-11-29 03:58:15,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,433 INFO L229 MonitoredProcess]: Starting monitored process 168 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2023-11-29 03:58:15,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2023-11-29 03:58:15,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,450 INFO L229 MonitoredProcess]: Starting monitored process 169 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2023-11-29 03:58:15,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 03:58:15,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2023-11-29 03:58:15,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,471 INFO L229 MonitoredProcess]: Starting monitored process 170 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2023-11-29 03:58:15,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 03:58:15,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2023-11-29 03:58:15,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,493 INFO L229 MonitoredProcess]: Starting monitored process 171 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2023-11-29 03:58:15,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2023-11-29 03:58:15,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,511 INFO L229 MonitoredProcess]: Starting monitored process 172 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2023-11-29 03:58:15,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 03:58:15,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 03:58:15,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 03:58:15,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2023-11-29 03:58:15,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,529 INFO L229 MonitoredProcess]: Starting monitored process 173 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2023-11-29 03:58:15,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2023-11-29 03:58:15,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,549 INFO L229 MonitoredProcess]: Starting monitored process 174 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2023-11-29 03:58:15,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:58:15,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2023-11-29 03:58:15,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,570 INFO L229 MonitoredProcess]: Starting monitored process 175 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2023-11-29 03:58:15,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2023-11-29 03:58:15,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,590 INFO L229 MonitoredProcess]: Starting monitored process 176 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2023-11-29 03:58:15,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2023-11-29 03:58:15,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,614 INFO L229 MonitoredProcess]: Starting monitored process 177 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2023-11-29 03:58:15,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2023-11-29 03:58:15,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,635 INFO L229 MonitoredProcess]: Starting monitored process 178 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2023-11-29 03:58:15,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:58:15,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2023-11-29 03:58:15,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,655 INFO L229 MonitoredProcess]: Starting monitored process 179 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2023-11-29 03:58:15,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2023-11-29 03:58:15,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,676 INFO L229 MonitoredProcess]: Starting monitored process 180 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2023-11-29 03:58:15,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2023-11-29 03:58:15,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,697 INFO L229 MonitoredProcess]: Starting monitored process 181 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2023-11-29 03:58:15,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 03:58:15,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2023-11-29 03:58:15,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,722 INFO L229 MonitoredProcess]: Starting monitored process 182 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2023-11-29 03:58:15,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 03:58:15,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2023-11-29 03:58:15,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,747 INFO L229 MonitoredProcess]: Starting monitored process 183 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2023-11-29 03:58:15,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 03:58:15,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 03:58:15,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 03:58:15,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 03:58:15,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 03:58:15,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 03:58:15,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 03:58:15,775 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 03:58:15,800 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-11-29 03:58:15,800 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2023-11-29 03:58:15,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 03:58:15,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:15,801 INFO L229 MonitoredProcess]: Starting monitored process 184 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 03:58:15,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2023-11-29 03:58:15,804 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 03:58:15,817 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 03:58:15,817 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 03:58:15,817 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#4 func_to_recursive_line_24_to_25_0_#in~c.base) 0)_2) = -2*v_rep(select (select #memory_int#4 func_to_recursive_line_24_to_25_0_#in~c.base) 0)_2 + 11 Supporting invariants [] [2023-11-29 03:58:15,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2023-11-29 03:58:15,874 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2023-11-29 03:58:15,877 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[#in~c!base][0] could not be translated [2023-11-29 03:58:15,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:58:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:58:16,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-29 03:58:16,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:58:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:58:19,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 03:58:19,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:58:19,988 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 03:58:20,038 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 03:58:20,038 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2023-11-29 03:58:20,039 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 341 states and 399 transitions. cyclomatic complexity: 77 Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:58:20,555 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 341 states and 399 transitions. cyclomatic complexity: 77. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 405 states and 469 transitions. Complement of second has 27 states. [2023-11-29 03:58:20,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 5 non-accepting loop states 1 accepting loop states [2023-11-29 03:58:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:58:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2023-11-29 03:58:20,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 23 transitions. Stem has 264 letters. Loop has 39 letters. [2023-11-29 03:58:20,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:58:20,557 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 03:58:20,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2023-11-29 03:58:20,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:58:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:58:21,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-29 03:58:21,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:58:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:58:24,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 03:58:24,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:58:24,618 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 03:58:24,661 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 03:58:24,662 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 5 loop predicates [2023-11-29 03:58:24,662 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 341 states and 399 transitions. cyclomatic complexity: 77 Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:58:25,206 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 341 states and 399 transitions. cyclomatic complexity: 77. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 405 states and 469 transitions. Complement of second has 27 states. [2023-11-29 03:58:25,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 5 non-accepting loop states 1 accepting loop states [2023-11-29 03:58:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:58:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2023-11-29 03:58:25,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 23 transitions. Stem has 264 letters. Loop has 39 letters. [2023-11-29 03:58:25,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:58:25,211 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 03:58:25,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:58:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:58:25,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-29 03:58:25,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:58:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:58:29,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 03:58:29,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:58:29,704 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 03:58:29,744 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 03:58:29,745 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 5 loop predicates [2023-11-29 03:58:29,745 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 341 states and 399 transitions. cyclomatic complexity: 77 Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:58:30,414 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 341 states and 399 transitions. cyclomatic complexity: 77. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 572 states and 653 transitions. Complement of second has 32 states. [2023-11-29 03:58:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 7 stem states 5 non-accepting loop states 1 accepting loop states [2023-11-29 03:58:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:58:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2023-11-29 03:58:30,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 48 transitions. Stem has 264 letters. Loop has 39 letters. [2023-11-29 03:58:30,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:58:30,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 48 transitions. Stem has 303 letters. Loop has 39 letters. [2023-11-29 03:58:30,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:58:30,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 48 transitions. Stem has 264 letters. Loop has 78 letters. [2023-11-29 03:58:30,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 03:58:30,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 572 states and 653 transitions. [2023-11-29 03:58:30,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 03:58:30,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 572 states to 234 states and 273 transitions. [2023-11-29 03:58:30,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-11-29 03:58:30,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-11-29 03:58:30,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 273 transitions. [2023-11-29 03:58:30,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 03:58:30,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 234 states and 273 transitions. [2023-11-29 03:58:30,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 273 transitions. [2023-11-29 03:58:30,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 193. [2023-11-29 03:58:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 110 states have (on average 1.0818181818181818) internal successors, (119), 119 states have internal predecessors, (119), 33 states have call successors, (33), 19 states have call predecessors, (33), 50 states have return successors, (69), 54 states have call predecessors, (69), 29 states have call successors, (69) [2023-11-29 03:58:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 221 transitions. [2023-11-29 03:58:30,431 INFO L240 hiAutomatonCegarLoop]: Abstraction has 193 states and 221 transitions. [2023-11-29 03:58:30,431 INFO L428 stractBuchiCegarLoop]: Abstraction has 193 states and 221 transitions. [2023-11-29 03:58:30,431 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-11-29 03:58:30,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 221 transitions. [2023-11-29 03:58:30,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 03:58:30,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 03:58:30,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 03:58:30,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [252, 252, 216, 216, 216, 42, 42, 36, 36, 36, 36, 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 03:58:30,438 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 03:58:30,440 INFO L748 eck$LassoCheckResult]: Stem: 62869#$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); 62835#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 62826#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 62861#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 62862#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 62912#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 62941#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 62940#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 62936#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62938#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62991#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62990#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62947#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62821#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62819#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62822#L41-1 assume true; 62850#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62866#L41-1 assume true; 62988#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62986#L41-1 assume true; 62983#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62980#L41-1 assume true; 62946#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62945#L41-1 assume true; 62944#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62943#L41-1 assume true; 62942#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62939#L41-1 assume true; 62935#func_to_recursive_line_24_to_25_0EXIT >#84#return; 62937#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 62813#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 62814#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 62930#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 62931#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62938#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62991#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62990#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62947#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62821#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62819#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62822#L41-1 assume true; 62850#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62866#L41-1 assume true; 62988#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62986#L41-1 assume true; 62983#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62980#L41-1 assume true; 62946#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62945#L41-1 assume true; 62944#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62943#L41-1 assume true; 62942#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62939#L41-1 assume true; 62935#func_to_recursive_line_24_to_25_0EXIT >#84#return; 62934#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 62812#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 62814#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 62930#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 62931#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62938#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62991#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62990#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62947#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62821#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62819#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62822#L41-1 assume true; 62850#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62866#L41-1 assume true; 62988#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62986#L41-1 assume true; 62983#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62980#L41-1 assume true; 62946#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62945#L41-1 assume true; 62944#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62943#L41-1 assume true; 62942#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62939#L41-1 assume true; 62935#func_to_recursive_line_24_to_25_0EXIT >#84#return; 62934#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 62812#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 62814#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 62930#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 62931#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62938#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62991#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62990#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62947#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62821#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62819#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62822#L41-1 assume true; 62850#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62866#L41-1 assume true; 62988#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62986#L41-1 assume true; 62983#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62980#L41-1 assume true; 62946#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62945#L41-1 assume true; 62944#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62943#L41-1 assume true; 62942#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62939#L41-1 assume true; 62935#func_to_recursive_line_24_to_25_0EXIT >#84#return; 62934#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 62812#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 62814#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 62930#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 62931#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62938#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62991#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62990#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62947#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62821#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62819#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62822#L41-1 assume true; 62850#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62866#L41-1 assume true; 62988#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62986#L41-1 assume true; 62983#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62980#L41-1 assume true; 62946#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62945#L41-1 assume true; 62944#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62943#L41-1 assume true; 62942#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62939#L41-1 assume true; 62935#func_to_recursive_line_24_to_25_0EXIT >#84#return; 62934#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 62812#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 62814#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 62930#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 62931#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62938#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62991#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62990#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62947#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62821#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62860#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62870#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62871#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62995#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62841#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62872#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62840#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62842#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62867#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62868#L25-1 assume true; 62856#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62843#L25-1 assume true; 62844#func_to_recursive_line_25_to_25_0EXIT >#92#return; 63001#L25-1 assume true; 63000#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62999#L25-1 assume true; 62998#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62997#L25-1 assume true; 62996#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62994#L25-1 assume true; 62993#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62992#L25-1 assume true; 62989#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62857#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62820#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62859#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62819#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62822#L41-1 assume true; 62850#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62866#L41-1 assume true; 62988#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62986#L41-1 assume true; 62983#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62980#L41-1 assume true; 62946#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62945#L41-1 assume true; 62944#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62943#L41-1 assume true; 62942#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62939#L41-1 assume true; 62935#func_to_recursive_line_24_to_25_0EXIT >#84#return; 62934#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 62812#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 62814#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 62855#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62823#L61-1 assume true; 62824#func_to_recursive_line_23_to_24_0EXIT >#86#return; 62831#L61-1 assume true; 62922#func_to_recursive_line_23_to_24_0EXIT >#86#return; 62921#L61-1 assume true; 62920#func_to_recursive_line_23_to_24_0EXIT >#86#return; 62919#L61-1 assume true; 62918#func_to_recursive_line_23_to_24_0EXIT >#86#return; 62917#L61-1 assume true; 62916#func_to_recursive_line_23_to_24_0EXIT >#86#return; 62915#L61-1 assume true; 62914#func_to_recursive_line_23_to_24_0EXIT >#86#return; 62913#L61-1 assume true; 62911#func_to_recursive_line_23_to_24_0EXIT >#88#return; 62839#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 62825#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 62827#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 62832#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~b.base, ~b.offset, 4); 62811#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 62810#$Ultimate##0 [2023-11-29 03:58:30,441 INFO L750 eck$LassoCheckResult]: Loop: 62810#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~b.base, ~b.offset, 4); 62845#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 62851#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62852#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62858#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62883#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62885#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62894#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62890#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62899#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62910#L25-1 assume true; 62909#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62908#L25-1 assume true; 62907#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62906#L25-1 assume true; 62905#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62904#L25-1 assume true; 62903#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62901#L25-1 assume true; 62898#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62892#L25-1 assume true; 62889#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62888#L25-1 assume true; 62882#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62880#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62817#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62873#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62874#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62884#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62885#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62894#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62890#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62899#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62910#L25-1 assume true; 62909#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62908#L25-1 assume true; 62907#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62906#L25-1 assume true; 62905#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62904#L25-1 assume true; 62903#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62901#L25-1 assume true; 62898#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62892#L25-1 assume true; 62889#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62888#L25-1 assume true; 62882#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62879#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62816#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62873#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62874#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62884#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62885#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62894#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62890#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62899#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62910#L25-1 assume true; 62909#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62908#L25-1 assume true; 62907#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62906#L25-1 assume true; 62905#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62904#L25-1 assume true; 62903#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62901#L25-1 assume true; 62898#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62892#L25-1 assume true; 62889#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62888#L25-1 assume true; 62882#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62879#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62816#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62873#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62874#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62884#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62885#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62894#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62890#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62899#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62910#L25-1 assume true; 62909#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62908#L25-1 assume true; 62907#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62906#L25-1 assume true; 62905#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62904#L25-1 assume true; 62903#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62901#L25-1 assume true; 62898#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62892#L25-1 assume true; 62889#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62888#L25-1 assume true; 62882#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62879#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62816#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62873#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62874#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62884#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62885#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62894#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62890#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62899#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62910#L25-1 assume true; 62909#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62908#L25-1 assume true; 62907#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62906#L25-1 assume true; 62905#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62904#L25-1 assume true; 62903#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62901#L25-1 assume true; 62898#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62892#L25-1 assume true; 62889#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62888#L25-1 assume true; 62882#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62879#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62816#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62873#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62874#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 62884#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62885#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62894#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62890#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62896#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 62891#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 62893#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 62899#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62910#L25-1 assume true; 62909#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62908#L25-1 assume true; 62907#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62906#L25-1 assume true; 62905#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62904#L25-1 assume true; 62903#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62901#L25-1 assume true; 62898#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62892#L25-1 assume true; 62889#func_to_recursive_line_25_to_25_0EXIT >#92#return; 62888#L25-1 assume true; 62882#func_to_recursive_line_25_to_25_0EXIT >#80#return; 62879#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 62816#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 62873#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 62815#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62818#L41-1 assume true; 62849#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62865#L41-1 assume true; 62902#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62900#L41-1 assume true; 62897#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62895#L41-1 assume true; 62887#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62886#L41-1 assume true; 62881#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62878#L41-1 assume true; 62877#func_to_recursive_line_24_to_25_0EXIT >#82#return; 62876#L41-1 assume true; 62875#func_to_recursive_line_24_to_25_0EXIT >#84#return; 62863#L67-1 call #t~mem11 := read~int#3(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 62809#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 62810#$Ultimate##0 [2023-11-29 03:58:30,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:58:30,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1906698421, now seen corresponding path program 2 times [2023-11-29 03:58:30,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:58:30,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284158629] [2023-11-29 03:58:30,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:58:30,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:58:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:58:31,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:58:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:58:32,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:58:32,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:58:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1020259306, now seen corresponding path program 2 times [2023-11-29 03:58:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:58:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733429445] [2023-11-29 03:58:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:58:32,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:58:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:58:32,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:58:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:58:33,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:58:33,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:58:33,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1310075788, now seen corresponding path program 3 times [2023-11-29 03:58:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:58:33,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057628711] [2023-11-29 03:58:33,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:58:33,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:58:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:58:34,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:58:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:58:35,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:00:47,592 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 04:00:47,592 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 04:00:47,592 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 04:00:47,592 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 04:00:47,592 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 04:00:47,592 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:47,592 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 04:00:47,592 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 04:00:47,593 INFO L133 ssoRankerPreferences]: Filename of dumped script: recursified_nested_4.c_Iteration18_Lasso [2023-11-29 04:00:47,593 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 04:00:47,593 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 04:00:47,597 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 04:00:47,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 04:00:47,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 04:00:47,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 04:00:47,603 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 04:00:47,605 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 04:00:47,606 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 04:00:47,608 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 04:00:47,609 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 04:00:47,611 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 04:00:47,633 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 04:00:47,634 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 04:00:47,636 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 04:00:47,638 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 04:00:47,639 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 04:00:47,641 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 04:00:47,643 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 04:00:47,644 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 04:00:47,646 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 04:00:47,648 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 04:00:49,023 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 04:00:49,024 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 04:00:49,026 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 04:00:49,027 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 04:00:49,029 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 04:00:49,030 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 04:00:49,032 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 04:00:49,033 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 04:00:49,035 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 04:00:49,036 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 04:00:49,038 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 04:00:49,039 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 04:00:49,041 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 04:00:49,042 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 04:00:49,043 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 04:00:49,045 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 04:00:49,046 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 04:00:49,048 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 04:00:49,049 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 04:00:49,051 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 04:00:49,052 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 04:00:49,054 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 04:00:49,056 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 04:00:49,995 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 04:00:49,995 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 04:00:49,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:49,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:49,996 INFO L229 MonitoredProcess]: Starting monitored process 185 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:49,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2023-11-29 04:00:49,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2023-11-29 04:00:50,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,018 INFO L229 MonitoredProcess]: Starting monitored process 186 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2023-11-29 04:00:50,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2023-11-29 04:00:50,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,039 INFO L229 MonitoredProcess]: Starting monitored process 187 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2023-11-29 04:00:50,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2023-11-29 04:00:50,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,060 INFO L229 MonitoredProcess]: Starting monitored process 188 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2023-11-29 04:00:50,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2023-11-29 04:00:50,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,081 INFO L229 MonitoredProcess]: Starting monitored process 189 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2023-11-29 04:00:50,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2023-11-29 04:00:50,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,102 INFO L229 MonitoredProcess]: Starting monitored process 190 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2023-11-29 04:00:50,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2023-11-29 04:00:50,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,216 INFO L229 MonitoredProcess]: Starting monitored process 191 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2023-11-29 04:00:50,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:00:50,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2023-11-29 04:00:50,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,237 INFO L229 MonitoredProcess]: Starting monitored process 192 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2023-11-29 04:00:50,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2023-11-29 04:00:50,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,258 INFO L229 MonitoredProcess]: Starting monitored process 193 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2023-11-29 04:00:50,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:00:50,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2023-11-29 04:00:50,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,278 INFO L229 MonitoredProcess]: Starting monitored process 194 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2023-11-29 04:00:50,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:00:50,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:00:50,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:00:50,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2023-11-29 04:00:50,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,302 INFO L229 MonitoredProcess]: Starting monitored process 195 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2023-11-29 04:00:50,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:00:50,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:00:50,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2023-11-29 04:00:50,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,329 INFO L229 MonitoredProcess]: Starting monitored process 196 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2023-11-29 04:00:50,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 04:00:50,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2023-11-29 04:00:50,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,351 INFO L229 MonitoredProcess]: Starting monitored process 197 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2023-11-29 04:00:50,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:00:50,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2023-11-29 04:00:50,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,372 INFO L229 MonitoredProcess]: Starting monitored process 198 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2023-11-29 04:00:50,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 04:00:50,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2023-11-29 04:00:50,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,392 INFO L229 MonitoredProcess]: Starting monitored process 199 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2023-11-29 04:00:50,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2023-11-29 04:00:50,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,412 INFO L229 MonitoredProcess]: Starting monitored process 200 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2023-11-29 04:00:50,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2023-11-29 04:00:50,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,435 INFO L229 MonitoredProcess]: Starting monitored process 201 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2023-11-29 04:00:50,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2023-11-29 04:00:50,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,456 INFO L229 MonitoredProcess]: Starting monitored process 202 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2023-11-29 04:00:50,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:00:50,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:00:50,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:00:50,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:00:50,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:00:50,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2023-11-29 04:00:50,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,477 INFO L229 MonitoredProcess]: Starting monitored process 203 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2023-11-29 04:00:50,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:00:50,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:00:50,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:00:50,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:00:50,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:00:50,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:00:50,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:00:50,505 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 04:00:50,531 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-11-29 04:00:50,531 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-11-29 04:00:50,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:00:50,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:00:50,533 INFO L229 MonitoredProcess]: Starting monitored process 204 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:00:50,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2023-11-29 04:00:50,534 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 04:00:50,546 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-29 04:00:50,546 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 04:00:50,546 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int#3) func_to_recursive_line_23_to_24_0_#in~b.base) func_to_recursive_line_23_to_24_0_#in~b.offset)_2) = -2*v_rep(select (select old(#memory_int#3) func_to_recursive_line_23_to_24_0_#in~b.base) func_to_recursive_line_23_to_24_0_#in~b.offset)_2 + 11 Supporting invariants [1*v_rep(select (select #memory_int#3 func_to_recursive_line_23_to_24_0_#in~b.base) 0)_2 - 1*v_rep(select (select old(#memory_int#3) func_to_recursive_line_23_to_24_0_#in~b.base) 0)_2 >= 0] [2023-11-29 04:00:50,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2023-11-29 04:00:50,645 INFO L156 tatePredicateManager]: 18 out of 20 supporting invariants were superfluous and have been removed [2023-11-29 04:00:50,652 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#3)[#in~b!base][#in~b!offset] could not be translated [2023-11-29 04:00:50,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:00:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:00:53,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 18014 conjuncts, 619 conjunts are in the unsatisfiable core [2023-11-29 04:00:54,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:01:11,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2023-11-29 04:01:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:28,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 2943 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 04:01:28,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:01:28,243 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 04:01:30,156 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 04:01:30,213 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 04:01:30,216 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2023-11-29 04:01:30,216 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 221 transitions. cyclomatic complexity: 38 Second operand has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 04:01:30,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 221 transitions. cyclomatic complexity: 38. Second operand has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Result 250 states and 284 transitions. Complement of second has 26 states. [2023-11-29 04:01:30,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 5 non-accepting loop states 1 accepting loop states [2023-11-29 04:01:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 04:01:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2023-11-29 04:01:30,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 29 transitions. Stem has 1557 letters. Loop has 255 letters. [2023-11-29 04:01:30,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 04:01:30,742 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 04:01:30,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:01:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:33,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 18014 conjuncts, 619 conjunts are in the unsatisfiable core [2023-11-29 04:01:34,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:02:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:07,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 2943 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 04:02:07,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:02:07,389 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 04:02:09,724 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 04:02:09,801 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 04:02:09,804 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 5 loop predicates [2023-11-29 04:02:09,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 221 transitions. cyclomatic complexity: 38 Second operand has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 04:02:10,676 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 221 transitions. cyclomatic complexity: 38. Second operand has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Result 250 states and 284 transitions. Complement of second has 26 states. [2023-11-29 04:02:10,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 5 non-accepting loop states 1 accepting loop states [2023-11-29 04:02:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 04:02:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2023-11-29 04:02:10,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 29 transitions. Stem has 1557 letters. Loop has 255 letters. [2023-11-29 04:02:10,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 04:02:10,681 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 04:02:10,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:14,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 18014 conjuncts, 619 conjunts are in the unsatisfiable core [2023-11-29 04:02:14,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:02:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:50,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 2943 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 04:02:50,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:02:50,616 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 04:02:52,610 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 04:02:52,673 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 04:02:52,675 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2023-11-29 04:02:52,676 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 221 transitions. cyclomatic complexity: 38 Second operand has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 04:02:53,636 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 221 transitions. cyclomatic complexity: 38. Second operand has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Result 367 states and 414 transitions. Complement of second has 30 states. [2023-11-29 04:02:53,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 5 non-accepting loop states 1 accepting loop states [2023-11-29 04:02:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 04:02:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2023-11-29 04:02:53,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 1557 letters. Loop has 255 letters. [2023-11-29 04:02:53,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 04:02:53,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 1812 letters. Loop has 255 letters. [2023-11-29 04:02:53,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 04:02:53,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 1557 letters. Loop has 510 letters. [2023-11-29 04:02:53,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 04:02:53,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 367 states and 414 transitions. [2023-11-29 04:02:53,659 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 04:02:53,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 367 states to 0 states and 0 transitions. [2023-11-29 04:02:53,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-11-29 04:02:53,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-11-29 04:02:53,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-11-29 04:02:53,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:02:53,660 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:02:53,660 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:02:53,660 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:02:53,661 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-11-29 04:02:53,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:02:53,661 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 04:02:53,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-11-29 04:02:53,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 04:02:53 BoogieIcfgContainer [2023-11-29 04:02:53,751 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-29 04:02:53,751 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:02:53,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:02:53,752 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:02:53,752 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:53:53" (3/4) ... [2023-11-29 04:02:53,754 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:02:53,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:02:53,766 INFO L158 Benchmark]: Toolchain (without parser) took 541069.98ms. Allocated memory was 138.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 91.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 226.0MB. Max. memory is 16.1GB. [2023-11-29 04:02:53,780 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:02:53,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.56ms. Allocated memory is still 138.4MB. Free memory was 91.0MB in the beginning and 80.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 04:02:53,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.99ms. Allocated memory is still 138.4MB. Free memory was 80.6MB in the beginning and 78.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:02:53,782 INFO L158 Benchmark]: Boogie Preprocessor took 47.55ms. Allocated memory is still 138.4MB. Free memory was 78.8MB in the beginning and 76.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:02:53,783 INFO L158 Benchmark]: RCFGBuilder took 393.70ms. Allocated memory is still 138.4MB. Free memory was 76.4MB in the beginning and 108.5MB in the end (delta: -32.1MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2023-11-29 04:02:53,783 INFO L158 Benchmark]: BuchiAutomizer took 540336.66ms. Allocated memory was 138.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 108.5MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-11-29 04:02:53,784 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 2.6GB. Free memory is still 2.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:02:53,786 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.17ms. Allocated memory is still 138.4MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.56ms. Allocated memory is still 138.4MB. Free memory was 91.0MB in the beginning and 80.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.99ms. Allocated memory is still 138.4MB. Free memory was 80.6MB in the beginning and 78.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.55ms. Allocated memory is still 138.4MB. Free memory was 78.8MB in the beginning and 76.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 393.70ms. Allocated memory is still 138.4MB. Free memory was 76.4MB in the beginning and 108.5MB in the end (delta: -32.1MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 540336.66ms. Allocated memory was 138.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 108.5MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 2.6GB. Free memory is still 2.4GB. 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#1[#in~a!base][#in~a!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[#in~b!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[#in~c!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[#in~d!base][#in~d!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[#in~d!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[#in~c!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#3)[#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 18 terminating modules (11 trivial, 4 deterministic, 3 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 10 locations. One deterministic module has affine ranking function null and consists of 12 locations. One deterministic module has affine ranking function null and consists of 5 locations. One nondeterministic module has affine ranking function null and consists of 13 locations. One nondeterministic module has affine ranking function null and consists of 13 locations. One nondeterministic module has affine ranking function null and consists of 12 locations. 11 modules have a trivial ranking function, the largest among these consists of 58 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 540.2s and 19 iterations. TraceHistogramMax:252. Analysis of lassos took 376.7s. Construction of modules took 4.2s. Büchi inclusion checks took 158.9s. Highest rank in rank-based complementation 3. Minimization of det autom 12. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 136 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 163791/163791 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1244 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1219 mSDsluCounter, 2144 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1703 mSDsCounter, 1060 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5265 IncrementalHoareTripleChecker+Invalid, 6325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1060 mSolverCounterUnsat, 441 mSDtfsCounter, 5265 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital323 mio100 ax100 hnf100 lsp95 ukn65 mio100 lsp19 div100 bol100 ite100 ukn100 eq208 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms 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 04:02:53,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 04:02:54,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 04:02:54,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 04:02:54,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 04:02:54,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:02:54,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:02:55,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:02:55,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 04:02:55,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_761e9011-fb77-4052-8d78-585865907a21/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